Results 31 to 40 of about 472 (183)

Cayley graphs of basic algebraic structures [PDF]

Discrete Mathematics & Theoretical Computer Science, 2020
We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups.
Didier Caucal
doaj   +1 more source

Integral Cayley Sum Graphs and Groups

Discussiones Mathematicae Graph Theory, 2016
For any positive integer k, let Ak denote the set of finite abelian groups G such that for any subgroup H of G all Cayley sum graphs CayS(H, S) are integral if |S| = k. A finite abelian group G is called Cayley sum integral if for any subgroup H of G all
Ma Xuanlong, Wang Kaishun
doaj   +1 more source

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q [PDF]

Journal of Algebraic Systems, 2020
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of ...
M. Ghorbani, A. Seyyed-Hadi, F. Nowroozi-Larki   +2 more
doaj   +1 more source

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   +2 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

A census of Cayley graphs

Journal of Symbolic Computation
Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism group. We use these methods to generate complete lists of pairwise nonisomorphic 3-valent Cayley graphs with at ...
Rhys J. Evans, Primož Potočnik
openaire   +4 more sources

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

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