On the semitotal domination number of line graphs

DOI10.1016/j.dam.2018.06.010zbMath1404.05161OpenAlexW2810361817MaRDI QIDQ1720344

Chanjuan Liu, En-Qiang Zhu

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.010

zbMATH Keywords

upper boundline graphsNP-complete problemsemitotal domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (8)

Semitotal domination subdivision numbers of graphs ⋮ Mixed domination and 2-independence in trees ⋮ Trees with unique minimum semitotal dominating sets ⋮ Semitotal domination number of some graph operations ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ Unnamed Item ⋮ Complexity and characterization aspects of edge-related domination for graphs ⋮ An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On domination and independent domination numbers of a graph
• A survey of selected recent results on total domination in graphs
• Minimum Edge Dominating Sets
• Edge Dominating Sets in Graphs
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: On the semitotal domination number of line graphs