Related papers: Cayley graphs and symmetric interconnection networ…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.
The $(n,k)$-star graphs are an important class of interconnection networks that generalize star graphs, which are superior to hypercubes. In this paper, we continue the work begun by Cheng et al.~(Graphs and Combinatorics 2017) and complete…
The spectral decomposition of graph adjacency matrices is an essential ingredient in the design of graph signal processing (GSP) techniques. When the adjacency matrix has multi-dimensional eigenspaces, it is desirable to base GSP…
In spite of the plethora of success stories with graph neural networks (GNNs) on modelling graph-structured data, they are notoriously vulnerable to over-squashing, whereby tasks necessitate the mixing of information between distance pairs…
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$.…
Torus networks of moderate degree have been widely used in the supercomputer industry. Tori are superb when used for executing applications that require near-neighbor communications. Nevertheless, they are not so good when dealing with…
We consider the family of undirected Cayley graphs associated with odd cyclic groups, and study statistics for the eigenvalues in their spectra. Our results are motivated by analogies between arithmetic geometry and graph theory.
We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…
A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…
A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. In this paper we give conditions for when a Cayley graph on an abelian group can be represented as a…
We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…
We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…
Given a finite simple graph $\Gamma$ on $n$ vertices its complementary prism is the graph $\Gamma\bar{\Gamma}$ that is obtained from $\Gamma$ and its complement $\bar{\Gamma}$ by adding a perfect matching, where each its edge connects two…