Connected domination critical graphs with a block having maximum number of cut vertices

Michael A. Henning and Pawaton Kaemawichanurat

Applied Mathematics and Computation, 2021, vol. 406, issue C

Abstract: A set D of vertices in a graph G is a dominating set if every vertex in V(G)−D is adjacent to a vertex in D. If the subgraph induced by the set D is connected, then D is a connected dominating set in G. The connected domination number of G,γc(G), is the minimum cardinality of a connected dominating set of G. A graph G is k-γc-critical if γc(G)=k and γc(G+uv)Keywords: Connected domination (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321003386
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:406:y:2021:i:c:s0096300321003386

DOI: 10.1016/j.amc.2021.126248

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().