Related papers: Cayley Incidence Graphs
In this paper, we introduce and initiate the study of quandle products of groups, a family of groups that includes graph products of groups, cactus groups, wreath products, and the recently introduced trickle groups. Our approach is…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
We study the Ollivier-Ricci curvature and its modification introduced by Lin, Lu, and Yau on graphs. We provide a complete characterization of all graphs with Lin-Lu-Yau curvature at least one. We then explore the relationship between the…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
In this paper we characterize all of Cayley graphs on dihedral groups with metric dimension two.
We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…
Overlays were introduced by R. H. Fox [6] as a subclass of covering maps. We offer a different view of overlays: it resembles the definition of paracompact spaces via star refinements of open covers. One introduces covering structures for…
The concept of the integrated adjacency matrix for mixed graphs was first introduced in [9], where its spectral properties were analyzed in relation to the structural characteristics of the mixed graph. Building upon this foundation, this…
A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Further, we give several constructions of divisible design…
A complex unit gain graph is a graph where each orientation of an edge is given a complex unit, which is the inverse of the complex unit assigned to the opposite orientation. We extend some fundamental concepts from spectral graph theory to…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We prove two theorems concerning incidence posets of graphs, cover graphs of posets and a related graph parameter. First, answering a question of Haxell, we show that the chromatic number of a graph is not bounded in terms of the dimension…