Bounds on the order of connected domination vertex critical graphs

Bounds on the order of connected domination vertex critical graphs

A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in D. Moreover, a dominating set D of G is a connected dominating set if G[D] is connected. The minimum cardinality of a connected dominating set of G is called the connected domination number of G and...

Full description

Bibliographic Details
Main Authors: Kaemawichanurat, P., Caccetta, Louis, Ananchuen, N.
Format: Journal Article
Published: Elsevier 2018
Online Access:http://hdl.handle.net/20.500.11937/74215

Similar Items

Similar Items