Results 1 to 10 of about 589,042 (217)
Approximating Cayley Diagrams Versus Cayley Graphs [PDF]
Combinatorics, Probability and Computing, 2012 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 Graphs Defined by Systems of Equations
Axioms, 2022 Let R be a finite ring. In this paper, we mainly explore the conditions to ensure the graph BΓn defined by a system of equations {fi|i=2,…,n} to be a Cayley graph or a Hamiltonian graph.
Fuyuan Yang +3 more
doaj +1 more source
Discrepancy and eigenvalues of Cayley graphs [PDF]
Czechoslovak Mathematical Journal, 2016 Dedicated to the memory of Professor Miroslav Fiedler, 33 pages, second version addresses changes arising from the referee report and includes an appendix with an earlier ...
Kohayakawa, Yoshiharu +2 more
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 1986 An example is given of a finite group A of order 144, with a generating set \(X=\{x,y\}\) such that \(x^ 3=y^ 2=1\) and such that the Cayley graph C(A,X) has genus 4 and characteristic -6 (both of which are small relative to the order of A), although there is no short relator of the form \((xy)^ r\) with ...
openaire +1 more source
Ars Mathematica Contemporanea35 pages, 2 ...
Árnadóttir, Arnbjörg Soffía +4 more
openaire +3 more sources
Novel Concepts in Rough Cayley Fuzzy Graphs with Applications
Journal of Mathematics, 2023 Today, fuzzy graphs (FGs) have a variety of applications in other fields of study, including medicine, engineering, and psychology, and for this reason, many researchers around the world are trying to identify their properties and use them in computer ...
Yongsheng Rao +5 more
doaj +1 more source
Vertex-transitive generalized Cayley graphs which are not Cayley graphs
European Journal of Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ademir Hujdurovic +2 more
openaire +1 more source
Journal of Combinatorial Theory, Series B, 1979 AbstractBy a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for the spectrum of the Cayley graph X(G,H) in terms of irreducible characters of the group G: λti,1+…+λti,ni=∑g1,…,gt∈HXiΠs=1tgs for any natural number t, where ξi is an
openaire +1 more source
Unitary Cayley graphs of Dedekind domain quotients
AKCE International Journal of Graphs and Combinatorics, 2016 If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}.
Colin Defant
doaj +1 more source
Complete Rotations in Cayley Graphs
European Journal of Combinatorics, 2001 Consider a Cayley graph \(\text{Cay}(G,S)\) of a finite group \(G\) generated by a set \(S=S^{-1}=\{s_0,\ldots,s_{|S|-1}\}\) where \(1\notin S\). A bijection \(\omega:G\to G\) is called a complete rotation of the graph if \(\omega(1)=1\) and \(\omega(xs_i)=\omega(x)s_{i+1}\) for all \(x\in G\) and all \(i\in{\mathbb{Z}}_{|S|}\).
Marie-Claude Heydemann +2 more
openaire +2 more sources