Matching of 5-γ-critical leafless graph with a cut edge

Yuxuan Yang and Mei Lu

Applied Mathematics and Computation, 2018, vol. 323, issue C, 58-63

Abstract: Given a graph G=(V,E), a subset S of V is a dominating set of G if every vertex in V∖S is adjacent to a vertex in S. The minimum cardinality of a dominating set in a graph G is called the domination number of G and is denoted by γ(G). A graph G is said to be k-γ-critical if γ(G)=k, but γ(G+e)Keywords: Domination number; Critical; Perfect matching; Nontrivial cut edge (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317308329
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:323:y:2018:i:c:p:58-63

DOI: 10.1016/j.amc.2017.11.050

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