Results 71 to 80 of about 20,494 (188)
, 2023 A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular Neumaier Cayley graph. We also characterize Neumaier Cayley graphs with small valency at most $10$.
openaire +2 more sources
Graphical small cancellation and hyperfiniteness of boundary actions
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned‐off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented) classical small cancellation groups, admit hyperfinite boundary actions, more precisely, the orbit equivalence ...
Chris Karpinski +2 more
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the class of Cayley partitionable graphs. This investigation is motivated by the Strong Perfect Graph Conjecture. Cayley partitionable graphs are Cayley Graphs which are closely related to near-factorizations of finite groups. We prove some structural properties of near-factorizations and give examples of Cayley
openaire +4 more sources
ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS
Studia Universitatis Babes-Bolyai Chemia, 2016 An (r, s)-fullerene graph is a planar 3-regular graph with only Cr and Cs faces, where Cn denotes a cycle of length n. In this paper, the (3,6)-fullerene Cayley graphs constructed from finite groups are classified.
Ali Reza ASHRAFI +2 more
doaj
Difference divisor graph of the finite group [PDF]
International Journal of Research in Industrial Engineering, 2018 Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that ...
R. V M S S Kiran Kumar, T. Chalapathi
doaj +1 more source
Uniform growth in small cancellation groups
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract An open question asks whether every group acting acylindrically on a hyperbolic space has uniform exponential growth. We prove that the class of groups of uniform uniform exponential growth acting acylindrically on a hyperbolic space is closed under taking certain geometric small cancellation quotients.
Xabier Legaspi, Markus Steenbock
wiley +1 more source
Perfect state transfer in unitary Cayley graphs over local rings [PDF]
Transactions on Combinatorics, 2014 In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph.
Yotsanan Meemark , Songpon Sriwongsa
doaj
On the ET0L subgroup membership problem in bounded automata groups
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We are interested in the subgroup membership problem in groups acting on rooted d$d$‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with d$d$ letters, form the boundary of the tree.
Alex Bishop +5 more
wiley +1 more source
On the Eigenvalue Spectrum of Cayley Graphs: Connections to Group Structure and Expander Properties
MathematicsCayley 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
Complete Rotations in Cayley Graphs
European Journal of Combinatorics, 2001 Consider a Cayley graph \(\text{Cay}(G,S)\) of a finite group \(G\) generated by a set \(S=S^{-1}=\{s_0,\ldots,s_{|S|-1}\}\) where \(1\notin S\). A bijection \(\omega:G\to G\) is called a complete rotation of the graph if \(\omega(1)=1\) and \(\omega(xs_i)=\omega(x)s_{i+1}\) for all \(x\in G\) and all \(i\in{\mathbb{Z}}_{|S|}\).
Heydemann, Marie-Claude +2 more
openaire +1 more source