GraphLearning’22: 1st International Workshop on Graph Learning

The First Workshop on Graph Learning aims to bring together researchers and practitioners from academia and industry to discuss recent advances and core challenges of graph learning. This workshop will be established as a platform for multiple disciplines such as computer science, applied mathematics, physics, social sciences, data science, complex networks, and systems engineering. Core challenges in regard to theory, methodology, and applications of graph learning will be the main center of discussions at the workshop

Theoretical Computer Science and Discrete Mathematics

This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity

Studies on Dimultigraph and Prograph Based Applications of Graph Theory in Computer Science

Graph Theory has gained an impulsion in the past few years in rapacious dimensions. Day by day with rapid advancements of the technology, its demand for proper utilization of resources is increasing at a drastic rate. Simultaneously, it has emerged as one of the most powerful tools for the illustration and solution of the problems that are basically chronological in nature. And many seemingly diverse problems in computer science have been worked out with the help of this thought. A special approach (DPBA model) for different kinds of graphs and their applications in computer science is proposed in this paper. It introduces dimultigraph by considering digraph. The approaches of dimultigraph are enumerated in simple manner. Introduction of prograph in performance evaluation in the model reflects its freshness as well as widely acceptance both theoretically and in implementation

Application of the Four-Color Theorem for coloring a city map

A graph can be defined as a mathematical representation of a network, or as a set of points connected by lines. By a graph can be defined all kind of transportation networks (air, rail), a telecommunication system, the internet … Graph theory is a branch of mathematics and had its beginnings in math problems. However, today it has grown into a significant area of mathematical research, with applications almost everywhere (in chemistry, operations research, social sciences, and computer science). In the paper basic definition of graph theory, then some definition of a chromatic number of a graph and certain theorems related with graph coloring are given. Then is considering the problem of map coloring with four colors. One way to consider this problem is with the theory of graphs, because graphs are closely related to maps. We considered the map of metropolitan area of Shtip and Skopje. For coloring, we use the software “Four color theorem – map solver”

An Introduction to Temporal Graphs: An Algorithmic Perspective

A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed as a sequence $G_1,G_2\ldots,G_l$ of static graphs over the same (static) set of nodes $V$. Though static graphs have been extensively studied, for their temporal generalization we are still far from having a concrete set of structural and algorithmic principles. Recent research shows that many graph properties and problems become radically different and usually substantially more difficult when an extra time dimension in added to them. Moreover, there is already a rich and rapidly growing set of modern systems and applications that can be naturally modeled and studied via temporal graphs. This, further motivates the need for the development of a temporal extension of graph theory. We survey here recent results on temporal graphs and temporal graph problems that have appeared in the Computer Science community