๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The panconnectivity and the pancycle-connectivity of

โœ Scribed by Chien-Hung Huang; Jywe-Fei Fang

Publisher
Springer US
Year
2008
Tongue
English
Weight
512 KB
Volume
50
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Panconnectivity and edge-fault-tolerant
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
โœ Meijie Ma; Guizhen Liu; Jun-Ming Xu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

As an enhancement on the hypercube Q n , the augmented cube AQ n , proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks, 40(2) (2002), 71-84], not only retains some of the favorable properties of Q n but also possesses some embedding properties that Q n does not. For

3-Connected line graphs of triangular gr
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
โœ H. J. Broersma; H. J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB ๐Ÿ‘ 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian