Traceability of connected domination critical graphs

Michael A. Henning, Nawarat Ananchuen and Pawaton Kaemawichanurat

Applied Mathematics and Computation, 2020, vol. 386, issue C

Abstract: A dominating set in a graph G is a set S of vertices of G such that every vertex outside S is adjacent to a vertex in S. A connected dominating set in G is a dominating set S such that the subgraph G[S] induced by S is connected. The connected domination number of G, γc(G), is the minimum cardinality of a connected dominating set of G. A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(G+uv)Keywords: Domination; Connected domination critical; Hamiltonicity; Traceability (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304161
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:386:y:2020:i:c:s0096300320304161

DOI: 10.1016/j.amc.2020.125455

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 ().