Results 91 to 100 of about 472 (183)
On normality of n-Cayley graphs
Applied Mathematics and Computation, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ademir Hujdurovic +2 more
openaire +4 more sources
Uniquely colorable Cayley graphs
Ars Mathematica Contemporanea, 2016 It is shown that the chromatic number χ ( G ) = k of a uniquely colorable Cayley graph G over a group Γ is a divisor of ∣Γ ∣ = n . Each color class in a k -coloring of G is a coset of a subgroup of order n / k of Γ . Moreover, it is proved that ( k − 1) n is a sharp lower bound for the number of edges of a uniquely k
Klotz, Walter, Sander, Torsten
openaire +3 more sources
Hamilton Cycles in Restricted and Incomplete Rotator Graphs
Journal of Graph Algorithms and Applications, 2012 The nodes of a rotator graph are the permutations of n, and an arc is directed from u to v if the first r symbols of u can be rotated one position to the left to obtain v. Restricted rotator graphs restrict the allowable rotations to r ∈ R for some R ⊆
Brett Stevens, Aaron Williams
doaj +1 more source
Rational subsets of finite groups [PDF]
International Journal of Group Theory, 2014 We characterize the rational subsets of a finite group and discuss the relations to integral Cayley graphs.
Roger Alperin
doaj
Rainbow Tetrahedra in Cayley Graphs
Discussiones Mathematicae Graph Theory, 2015 Let Γn be the complete undirected Cayley graph of the odd cyclic group Zn. Connected graphs whose vertices are rainbow tetrahedra in Γn are studied, with any two such vertices adjacent if and only if they share (as tetrahedra) precisely two distinct ...
Dejter Italo J.
doaj +1 more source
Cayley graphs and complexity geometry
Journal of High Energy Physics, 2019 The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the identity, and simple operators near. By restricting our attention to a finite subgroup of the unitary
Henry W. Lin
doaj +1 more source
Quartic integral Cayley graphs
Ars Mathematica Contemporanea, 2015 We give exhaustive lists of connected 4-regular integral Cayley graphs and connected 4-regular integral arc-transitive graphs. An integral graph is a graph for which all eigenvalues are integers. A Cayley graph Cay(Γ, S) for a given group Γ and connection set S ⊂ Γ is the graph with vertex set Γ and with a connected to b if and only if ba−1 ∈ S.
Minchenko, Marsha, Wanless, Ian M.
openaire +3 more sources
Cayley hypergraph over polygroups [PDF]
Transactions on CombinatoricsComer introduced a class of hypergroups, using the name of polygroups. He emphasized the importance of polygroups, by analyzing them in connections to graphs, relations, Boolean and cylindric algebras.
Abolfazl Nikkhah, Bijan Davvaz
doaj +1 more source
Tetravalent Arc-Transitive Graphs of Order 3p2
Discussiones Mathematicae Graph Theory, 2014 Let s be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on (s + 1)-arcs. Let p be a prime.
Ghasemi Mohsen
doaj +1 more source
On Cayley graphs of {\bb Z}^4. [PDF]
Acta Crystallogr A Found Adv, 2020 Baburin IA.
europepmc +1 more source