Complexity and characterization aspects of edge-related domination for graphs

Zhuo Pan, Xianyue Li and Shou-Jun Xu ()
Additional contact information
Zhuo Pan: Lanzhou University
Xianyue Li: Lanzhou University
Shou-Jun Xu: Lanzhou University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 3, No 9, 757-773

Abstract: Abstract For a connected graph $$G = (V, E)$$ G = ( V , E ) , a subset F of E is an edge dominating set (resp. a total edge dominating set) if every edge in $$E-F$$ E - F (resp. in E) is adjacent to at least one edge in F, the minimum cardinality of an edge dominating set (resp. a total edge dominating set) of G is the edge domination number (resp. total edge domination number) of G, denoted by $$\gamma '(G)$$ γ ′ ( G ) (resp. $$\gamma '_t(G)$$ γ t ′ ( G ) ). In the present paper, we study a parameter, called the semitotal edge domination number, which is squeezed between $$\gamma '(G)$$ γ ′ ( G ) and $$\gamma '_t(G)$$ γ t ′ ( G ) . A semitotal edge dominating set is an edge dominating set S such that, for every edge e in S, there exists such an edge $$e'$$ e ′ in S that e either is adjacent to $$e'$$ e ′ or shares a common neighbor edge with $$e'$$ e ′ . The semitotal edge domination number, denoted by $$\gamma ^{'}_{st}(G)$$ γ st ′ ( G ) , is the minimum cardinality of a semitotal edge dominating set of G. In this paper, we prove that the problem of deciding whether $$\gamma ^{'}(G)=\gamma ^{'}_{st}(G)$$ γ ′ ( G ) = γ st ′ ( G ) or $$\gamma _t^{'}(G)=\gamma ^{'}(G)$$ γ t ′ ( G ) = γ ′ ( G ) is NP-hard even when restricted to planar graphs with maximum degree 4. We also characterize trees with equal edge domination and semitotal edge domination numbers (Pan et al. in The complexity of total edge domination and some related results on trees, J Comb Optim, 2020, https://doi.org/10.1007/s10878-020-00596-y , we characterized trees with equal edge domination and total edge domination numbers).

Keywords: Semitotal edge domination; Edge domination; Total edge domination; Trees; NP-hardness (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00622-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:40:y:2020:i:3:d:10.1007_s10878-020-00622-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00622-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().