Results 71 to 80 of about 589,042 (217)

Normal edge-transitive and $ frac{1}{2}$-arc-transitive Cayley graphs on non-abelian groups of order $2pq$ , $p > q$ are primes [PDF]

open access: yesInternational Journal of Group Theory, 2016
Darafsheh and Assari in [Normal edge-transitive Cayley graphs onnon-abelian groups of order 4p, where p is a prime number,Sci. China Math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and$frac{1}{2}-$arc-transitive ...
Ali Reza Ashrafi, Bijan Soleimani
doaj  

Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer

open access: yesOpen Mathematics, 2019
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex ...
Liu Hailin
doaj   +1 more source

Shifts in Cayley graphs

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Isomorphisms of generalized Cayley graphs

open access: yesArs Mathematica Contemporanea, 2018
Summary: In this paper, we investigate the isomorphism problems of the generalized Cayley graphs, which are generalizations of the traditional Cayley graphs. We find that there are two types of natural isomorphisms for the generalized Cayley graphs. We also study the GCI-groups among the generalized Cayley graphs, and the Cayley regressions of some ...
Xu Yang, Weijun Liu, Lihua Feng
openaire   +5 more sources

Groups with a finite Busemann boundary are virtually cyclic

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.
Abstract This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric‐functional boundary. We show that if there exists a Cayley graph with finitely many Busemann points, then the underlying group is virtually cyclic.
Corentin Bodart   +2 more
wiley   +1 more source

On quasiabelian Cayley graphs

open access: yesDiscrete Mathematics, 2001
The author considers the Cayley graphs \(\Gamma\) of a group \(G\) which have the property that \(\Aut\Gamma= L(G)R(G)\), where \(L(G)\) and \(R(G)\) denote the left and the right regular representation of \(G\). He proves that this equation holds if and only if \(\Gamma\) is a graphical regular representation of \(G\cong (\mathbb{Z})^n\) \((n> 4)\).
openaire   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) in PG ( 7 , q 3 )

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS

open access: yesStudia 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  

Domination Parameters of the Unitary Cayley Graph of 𝕑/n𝕑

open access: yesDiscussiones Mathematicae Graph Theory, 2023
The unitary Cayley graph of 𝕑/n𝕑, denoted Xn, is the graph with vertex set {0, . . ., n − 1} where vertices a and b are adjacent if and only if gcd(a − b, n) = 1.
Burcroff Amanda
doaj   +1 more source

Perfect Codes in Cayley Graphs [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2018
This is the final version that will appear in SIAM J.
He Huang, Binzhou Xia, Sanming Zhou
openaire   +3 more sources

Home - About - Disclaimer - Privacy