A Characterization of 3-(γc, 2)-Critical Claw-Free Graphs Which are not 3-γc-Critical

A Characterization of 3-(γc, 2)-Critical Claw-Free Graphs Which are not 3-γc-Critical

Let γ c (G) denote the minimum cardinality of a connected dominating set for G. A graph G is k-γ c -critical if γ c (G) = k, but γ c (G + xy) < k for xy Î E([`(G)])xyE(G) . Further, for integer r ≥ 2, G is said to be k-(γ c , r)-critical if γ c (G) = k, but γ c (G + xy) < k for each pair of no...

Full description

Bibliographic Details
Main Authors: Ananchuen, Watcharaphong, Ananchuen, Nawarat, Caccetta, Louis
Format: Journal Article
Published: Springer Japan KK 2010
Subjects:
Critical graph
Connected domination
Claw-free
Online Access:http://hdl.handle.net/20.500.11937/19085

Similar Items

Similar Items