Search
Search Results
-
Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs”
Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph G . The nodes of the reduced clique graph are the maximal cliques of G ...
-
Two-geodesic-transitive Graphs and Vertex-transitive Diameter Two Hexavalent Graphs
In this paper, we first investigate the family of vertex-transitive diameter 2 hexavalent graphs and particularly completely determine such graphs...
-
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
Since the CSP dichotomy conjecture has been established, a number of other dichotomy questions have attracted interest, including one for list...
-
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
A conflict-free coloring of a graph G is a (partial) coloring of its vertices such that every vertex u has a neighbor whose assigned color is unique...
-
Activity graphs: Spatial graphs as a framework for quantifying individual mobility
Human mobility is poorly captured by existing methods which employ simple measures to quantify human mobility patterns. This paper develops spatial...
-
Graphs
Many problems in Computer Science and Mathematics can be reduced to a set of states and a set of transitions between these states. A graph is a...
-
-
Discrete Graphs
The spectra of metric equilateral metric graphs are essentially determined by the spectra of the normalised or averaging Laplacian matrices...
-
Knowledge Graphs
We conclude Part I of the book with a short transition to knowledge graphs, which we put in context in the previous nine chapters. We make an...
-
On Dominating Graph of Graphs, Median Graphs, Partial Cubes and Complement of Minimal Dominating Sets
The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their...
-
Enumeration of Labeled Bi-Block Graphs
AbstractA bi-block graph is a connected graph in which all blocks are complete bipartite graphs. Labeled bi-block graphs and bridgeless bi-block...
-
Beyond symmetry in generalized Petersen graphs
A graph is a core or unretractive if all its endomorphisms are automorphisms. Well-known examples of cores include the Petersen graph and the graph...
-
Graphs and Weighted Graphs
The theory of graphs has progressedGraph Weighted graph a lot after Leonhard Euler used a graph-theoretic approach to solve the seven Konigsberg...
-
Injective Coloring of Product Graphs
The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning...
-
Mean Distance on Metric Graphs
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties...
-
An Introduction to Knowledge Graphs
This textbook introduces the theoretical foundations of technologies essential for knowledge graphs. It also covers practical examples, applications...
-
Boundary Control for Graphs with Cycles: Dismantling Graphs
The goal of this chapter is two-fold: we first describe the general strategy to solve the inverse problems for graphs with cycles; the second part...