论文信息 - The *-closure for graphs and claw-free graphs

The *-closure for graphs and claw-free graphs

A closure concept for undirected graphs based on the structure of the second neighborhood of a vertex is introduced. It is shown that the closure of a graph is uniquely determined and that the closure operation preserves the length of a longest path and cycle. Some related closure concepts are also discussed. A generalization of some known closure concepts is obtained.

Roman Ada

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Zdenek Ryjácek,et al. Strengthening the closure concept in claw-free graphs , 2001, Discret. Math..

[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[4] Haitze J. Broersma,et al. A note on K4-closures in hamiltonian graph theory , 1993, Discret. Math..

[5] Béla Bollobás,et al. Closure and Hamiltonian-connectivity of claw-free graphs , 1999, Discret. Math..

[6] Stephan Brandt. 9-Connected Claw-Free Graphs Are Hamilton-Connected , 1999, J. Comb. Theory, Ser. B.

[7] Haitze J. Broersma,et al. Closure concepts for claw-free graphs , 1998, Discret. Math..

[8] O. Favaron,et al. Closure and stable Hamiltonian properties in claw-free graphs , 2000 .

[9] Roman Ada. Degree conditions on induced claws , 2008 .

[10] Zdeněk Ryjáčk. On a Closure Concept in Claw-Free Graphs , 1997 .