Results 101 to 110 of about 994,076 (215)
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
Independence and strong independence complexes of finite groups
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract Let G$G$ be a finite group. In [10], two different concepts of independence (namely, independence and strong independence) are introduced for the subsets of G$G$, yielding to the definition of two simplicial complexes whose vertices are the elements of G$G$. The strong independence complex Σ∼(G)$\tilde{\Sigma }(G)$ turns out to be a subcomplex
Andrea Lucchini, Mima Stanojkovski
wiley +1 more source
Classification of 14-Valent 1-Regular Core-Free Cayley Graphs
MathematicsA Cayley graph Σ=Cay(G,S) is called 1-regular core-free if G is core-free in some Y⩽AutΣ and AutΣ acts regularly on the set of 1-arcs of Σ. In this paper, we classify the 14-valent 1-regular core-free Cayley graphs.
Liting Yang, Yali Li
doaj +1 more source
An extended definition of Anosov representation for relatively hyperbolic groups
Journal of Topology, Volume 19, Issue 2, June 2026.Abstract We define a new family of discrete representations of relatively hyperbolic groups which unifies many existing definitions and examples of geometrically finite behavior in higher rank. The definition includes the relative Anosov representations defined by Kapovich–Leeb and Zhu, and Zhu–Zimmer, as well as holonomy representations of various ...
Theodore Weisman
wiley +1 more source
L(2, 1)-Labeling of Circulant Graphs
Discussiones Mathematicae Graph Theory, 2019 An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj +1 more source
The arc-types of Cayley graphs
Ars Mathematica Contemporanea, 2018 Summary: Let \(X\) be a finite vertex-transitive graph of valency \(d\), and let \(A\) be the full automorphism group of \(X\). Then the arc-type of \(X\) is defined in terms of the sizes of the orbits of the action of the stabiliser \(A_v\) of a given vertex \(v\) on the set of arcs incident with \(v\). Specifically, the arc-type is the partition of \(
Conder, Marston, Poznanovic, Nemanja
openaire +4 more sources
On Isomorphisms of Finite Cayley Graphs
European Journal of Combinatorics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marston D. E. Conder, Cai Heng Li
openaire +1 more source
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring. The total graph T Γ ( R ) of R is the undirected graph with vertex set R and two distinct vertices x and y are adjacent if x + y is a zero divisor in R . In this paper, we present a survey of results on the genus of T Γ ( R )
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Distributed and Fault-Tolerant Routing for Borel Cayley Graphs
International Journal of Distributed Sensor Networks, 2012 We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment.
Junghun Ryu, Eric Noel, K. Wendy Tang
doaj +1 more source
Simulations of Cayley graphs of dihedral group [PDF]
ITM Web of ConferencesLet Γ be a finite group with identity element e and let S ⊆ Γ − {e} which is inverse-closed, i.e., S = S−1 := {s−1 : s ∈ S}. An undirected Cayley graph on a group Γ with connection set S, denoted by Cay(Γ, S), is a graph with vertex set Γ and edges xy ...
Farhan Mohammad +2 more
doaj +1 more source