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

Large 2-Independent Sets of Regular Graphs

โœ Scribed by W. Duckworth; M. Zito

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
174 KB
Volume
78
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Independent Dominating Sets and a Second
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

In 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamiltonian cycle. Combined with earlier results this would imply that every Hamiltonian r-regular graph (r 3) has a second Hamiltonian cycle. We shall verify this for r 300.

Maximum genus and maximum nonseparating
Maximum genus and maximum nonseparating independent set of a 3-regular graph
โœ Yuangqiu Huang; Yanpei Liu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 440 KB

A set J C V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E A {uv [ Vu, v E J} = 0, and G -J is connected. We call z(G) = maxJ{lJ[ tJ is an nsis of G} the nsis number of G. Let G be a 3-regular connected graph; we prove that