𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-abelian cayley graphs and parsons graphs

✍ Scribed by Jun Wang; Ming-Yao Xu

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
304 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Isomorphisms of Cayley Graphs of
On the Isomorphisms of Cayley Graphs of Abelian Groups
✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

On Normal Cayley Graphs and Hom-idempote
On Normal Cayley Graphs and Hom-idempotent Graphs
✍ Benoit Larose; François Laviolette; Claude Tardif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A graph G is said to be hom-idempotent if there is a homomorphism from G 2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from G n+1 to G n . We characterize both classes of graphs in terms of a special class of Cayley graphs called normal Cayley graphs. This allows us to

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Štefko MiklaviČ; Primož Šparl 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐

Large Cayley graphs and vertex-transitiv
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

Hamiltonian Decompositions of Cayley Gra
Hamiltonian Decompositions of Cayley Graphs on Abelian Groups of Odd Order
✍ Jiuqiang Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a

Tetravalent half-edge-transitive graphs
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs
✍ Xiuyun Wang; Yan-Quan Feng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Let X be a vertex-transitive graph, that is, the automorphism group Aut(X ) of X is transitive on the vertex set of X . The graph X is said to be symmetric if Aut(X ) is transitive on the arc set of X . Suppose that Aut(X ) has two orbits of the same length on the arc set of X . Then X is said to be