Results 1 to 10 of about 20,494 (188)
On transitivity and connectedness of Cayley graphs of gyrogroups [PDF]
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected.
Rasimate Maungchang +3 more
doaj +2 more sources
Hamiltonian Normal Cayley Graphs
A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +3 more sources
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note,
Ganesan Ashwin
doaj +3 more sources
Integral Cayley graphs and groups [PDF]
We solve two open problems regarding the classification of certain classes of Cayley graphs with integer eigenvalues. We first classify all finite groups that have a "non-trivial" Cayley graph with integer eigenvalues, thus solving a problem proposed by ...
Ahmady, Azhvan +2 more
core +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guo, W. +3 more
openaire +2 more sources
Cayley and Tutte polytopes [PDF]
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
We survey some of the known results on eigenvalues of Cayley graphs and their applications, together with related results on eigenvalues of Cayley digraphs and generalizations of Cayley graphs.
Liu, Xiaogang, Zhou, Sanming
openaire +3 more sources
Domination in Cayley graphs: A survey
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
Approximating Cayley Diagrams Versus Cayley Graphs [PDF]
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by ...
openaire +3 more sources
Cayley Bipolar Fuzzy Graphs [PDF]
We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures. We also discuss connectedness in Cayley bipolar fuzzy graphs.
N. O. Alshehri, Muhammad Akram
openaire +3 more sources

