Results 81 to 90 of about 452 (178)
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. [PDF]
Erde J, Lehner F.
europepmc +1 more source
The Planar Cubic Cayley Graphs [PDF]
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to conjectures of Mohar, Bonnington and Watkins.
openaire +2 more sources
Cayley graphs and complexity geometry
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
Vertex-transitive generalized Cayley graphs which are not Cayley graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hujdurović, Ademir +2 more
openaire +1 more source
Rational subsets of finite groups [PDF]
We characterize the rational subsets of a finite group and discuss the relations to integral Cayley graphs.
Roger Alperin
doaj
Cayley hypergraph over polygroups [PDF]
Comer 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
Hamiltonicity of cubic Cayley graphs
Following a problem posed by Lovász in 1969, it is believed that every finite connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from finite groups having a (2,s,3) -presentation ...
Glover, Henry, Marusic, Dragan
openaire +3 more sources
Connectivity of addition Cayley graphs
For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.
Grynkiewicz, David +2 more
openaire +2 more sources
Tetravalent Arc-Transitive Graphs of Order 3p2
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

