Related papers: Structural characterization of Cayley graphs
For a graph $\Gamma=(V\Gamma,E\Gamma)$, a subset $D$ of $V\Gamma$ is a perfect code in $\Gamma$ if every vertex of $\Gamma$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…
We study Cayley configuration spaces of a class of 1 degree-of-freedom linkages (graphs with specified edge lengths), obtained by dropping an edge from a tree-decomposable graph. The class includes well-known mechanisms based on the…
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary…
A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
A generalised Paley map is a Cayley map for the additive group of a finite field F, with a subgroup S=-S of the multiplicative group as generating set, cyclically ordered by powers of a generator of S. We characterise these as the…
Architecture styles characterise families of architectures sharing common characteristics. We have recently proposed configuration logics for architecture style specification. In this paper, we study a graphical notation to enhance…
Bayesian networks are a widely-used class of probabilistic graphical models capable of representing symmetric conditional independence between variables of interest using the topology of the underlying graph. For categorical variables, they…
Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is…
A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…
This paper deals with some of the algebraic properties of Sierpi\'nski graphs and a family of regular generalized Sierpi\'nski graphs. For the family of regular generalized Sierpi\'nski graphs, we obtain their spectrum and characterize…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…