Results 41 to 50 of about 472 (183)
Approximating Cayley Diagrams Versus Cayley Graphs [PDF]
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by ...
openaire +2 more sources
On the Unitary Cayley Graph of a Ring [PDF]
Let $R$ be a ring with identity. The unitary Cayley graph of a ring $R$, denoted by $G_{R}$, is the graph, whose vertex set is $R$, and in which $\{x,y\}$ is an edge if and only if $x-y$ is a unit of $R$. In this paper we find chromatic, clique and independence number of $G_{R}$, where $R$ is a finite ring.
Dariush Kiani, Mohsen Molla Haji Aghaei
openaire +2 more sources
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
An example is given of a finite group A of order 144, with a generating set \(X=\{x,y\}\) such that \(x^ 3=y^ 2=1\) and such that the Cayley graph C(A,X) has genus 4 and characteristic -6 (both of which are small relative to the order of A), although there is no short relator of the form \((xy)^ r\) with ...
openaire +1 more source
On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties
Cayley graphs sit at the intersection of algebra, geometry, and theoretical computer science. Their spectra encode fine structural information about both the underlying group and the graph itself.
Mohamed A. Abd Elgawad +4 more
doaj +1 more source
Signed Projective Cubes, a Homomorphism Point of View
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
The autors introduce the concept of generalized Cayley graph. The main result is that if \(X\) is a graph, \(B(X)\) its double covering then \(B(X)\) is a Cayley graph if and only if \(X\) is a generalized Cayley graph. Another result is that a generalized Cayley graph that is stable is a Cayley graph. Furthermore a construction is given of a family of
MARUSIC D. +2 more
openaire +3 more sources
Symmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph.
Li Wang, Xiaohan Ye, Weihua Yang
doaj +1 more source
Free semigroups of large critical exponent
Abstract For a convergence group equipped with an expanding coarse‐cocycle, we construct finitely generated free subsemigroups, which we call Bishop−−Jonessemigroups$\textit{Bishop--Jones semigroups}$, of critical exponent arbitrarily close to but strictly less than the critical exponent of the ambient group.
Aleksander Skenderi
wiley +1 more source
Unitary Cayley graphs of Dedekind domain quotients
If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}.
Colin Defant
doaj +1 more source

