𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mutually orthogonal hamiltonian connected graphs

✍ Scribed by Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; Lih-Hsing Hsu

Book ID
108052467
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
464 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian-connected graphs
Hamiltonian-connected graphs
✍ Zhao Kewen; Hong-Jian Lai; Ju Zhou πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 258 KB
On hamiltonian-connected graphs
On hamiltonian-connected graphs
✍ Ronald J. Gould; Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ β‰… __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

Mutually orthogonal graph squares
Mutually orthogonal graph squares
✍ R. Sampathkumar; S. Srinivasan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 89 KB

## Abstract A __decomposition__ 𝒒={__G__~1~, __G__~2~,…,__G__~__s__~} of a graph G is a partition of the edge set of G into edge‐disjoint subgraphs __G__~1~, __G__~2~,…,__G__~__s__~. If __G__~__i__~β‰…__H__ for all __i__∈{1, 2, …, __s__}, then 𝒒 is a decomposition of G by H. Two decompositions 𝒒={__G

On Hamiltonian-connected regular graphs
On Hamiltonian-connected regular graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 360 KB πŸ‘ 1 views

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian