Results 41 to 50 of about 420,658 (213)

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

Discussiones 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

On the metric dimension of Cayley graphs

AKCE International Journal of Graphs and Combinatorics, 2022
In this paper, we investigate the metric dimension, local metric dimension and edge metric dimension for some (generalized) Cayley graphs.
Afsaneh Rezaei, Kazem Khashyarmanesh, Mojgan Afkhami   +2 more
doaj   +1 more source

On the connectivity of cayley graphs

Journal of Combinatorial Theory, Series B, 1979
AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff.
openaire   +3 more sources

A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A₁₁₉

Mathematics, 2021
A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y.
Bo Ling, Wanting Li, Bengong Lou
doaj   +1 more source

Meta-Cayley Graphs on Dihedral Groups [PDF]

, 2017
>Magister Scientiae - MScThe pursuit of graphs which are vertex-transitive and non-Cayley on groups has been ongoing for some time. There has long been evidence to suggest that such graphs are a very rarety in occurrence.
Allie, Imran
core  

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

On edge-hamiltonian Cayley graphs [PDF]

, 1994
Chen (1988) conjectured that every finite hamiltonian Cayley graph is edge-hamiltonian. We prove some hamiltonian Cayley graphs to be edge-hamiltonian and some Cayley graphs to be hamiltonian.
Ulrike Baumann, Baumann, Ulrike
core   +1 more source

Context‐free graphs and their transition groups

Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
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, Francesco Matucci, Davide Perego, Emanuele Rodaro   +3 more
wiley   +1 more source

Cayley partitionable graphs

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   +1 more source

On Finite Subnormal Cayley Graphs [PDF]

The Electronic Journal of Combinatorics, 2021
In this paper we introduce and study a type of Cayley graph – subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $\mathbf{K}_{p^d,p^d}$ with $p$ prime.
openaire   +3 more sources