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

On hamiltonicity ofP3-dominated graphs

โœ Scribed by H. J. Broersma; E. Vumar

Book ID
105857511
Publisher
Springer
Year
2008
Tongue
English
Weight
165 KB
Volume
69
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Isomorphisms ofP3-graphs
Isomorphisms ofP3-graphs
โœ Li, Xueliang ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 324 KB

For graphs G and G' with minimum degree at least 3 and satisfying one of three other conditions, w e prove that any isomorphism from the &graph P3(G) onto P3(G') can be induced by a (vertex-) isomorphism of G onto G'. This in some sense can be viewed as a counterpart with respect to P3-graphs for Wh

Hamiltonicity of 3-Arc Graphs
Hamiltonicity of 3-Arc Graphs
โœ Guangjun Xu, Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 336 KB
Independence and hamiltonicity in 3-domi
Independence and hamiltonicity in 3-domination-critical graphs
โœ Favaron, Odile; Tian, Feng; Zhang, Lei ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 3 views

Let ฮด, ฮณ, i and ฮฑ be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-ฮณ-critical if ฮณ = 3 and the addition of any edge decreases ฮณ by 1. It was conjectured that any connected 3-ฮณ-critical graph satisf