✦ LIBER ✦

Panpositionable hamiltonicity of the alternating group graphs

✍ Scribed by Yuan-Hsiang Teng; Jimmy J.M. Tan; Lih-Hsing Hsu

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 352 KB
Volume: 50
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20184

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Panconnectivity, fault-tolerant hamilton

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

✍ Jou-Ming Chang; Jinn-Shyong Yang; Yue-Li Wang; Yuwen Cheng 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB

Edge-fault-tolerant pancyclicity of alte

Edge-fault-tolerant pancyclicity of alternating group graphs

✍ Ping-Ying Tsai; Gen-Huey Chen; Jung-Sheng Fu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Expansion Properties of Cayley Graphs of

Expansion Properties of Cayley Graphs of the Alternating Groups

✍ Yuval Roichman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let C be a conjugacy class in the alternating group A n , and let supp(C) be the number of nonfixed digits under the action of a permutation in C. For every 1>$>0 and n 5 there exists a constant c=c($)>0 such that if supp(C) $n then the undirected Cayley graph X(A n , C) is a c expander. A family of

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‐

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is