Results 31 to 40 of about 420,658 (213)
Domination in Cayley graphs: A survey
AKCE International Journal of Graphs and Combinatorics, 2019 Let Ω be a symmetric generating set of a finite group Γ. Assume that (Γ,Ω)be such that Γ=〈Ω〉and Ω satisfies the two conditions C1: the identity element e∉Ω and C2: if a∈Ω, then a−1∈Ω. Given (Γ,Ω)satisfying C1and C2, define a Cayley graph G=Cay(Γ,Ω)with V(
T. Tamizh Chelvam, M. Sivagami
doaj +2 more sources
Brief survey on divisor graphs and divisor function graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Number theoretic graphs are one of the emerging fields in Graph theory. This article is a study on existing research results on Number theoretic graphs, especially on Divisor Graphs [Formula: see text], Divisor Function Graphs (DFGs) and Divisor Cayley ...
Vignesh Ravi, Kalyani Desikan
doaj +1 more source
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Cayley and Tutte polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs.
Matjaž Konvalinka, Igor Pak
doaj +1 more source
Improved Expansion of Random Cayley Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the ...
Po-Shen Loh, Leonard J. Schulman
doaj +2 more sources
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
Orthogonal colourings of Cayley graphs [PDF]
Discrete Mathematics, 2020 Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of Cayley graphs are discussed.
Jeannette C. M. Janssen, Kyle MacKeigan
openaire +4 more sources
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
Electronic Notes in Discrete Mathematics, 2016 Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
Deepa Sinha, Deepakshi Sharma
openaire +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 +2 more
doaj +1 more source