Semitotal domination subdivision numbers of graphs

DOI10.1080/09720529.2019.1645393zbMath1483.05116OpenAlexW2981595788MaRDI QIDQ5034578

Yunfang Tang, Qin Chen

Publication date: 18 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1645393

zbMATH Keywords

computational complexitysemitotal domination numbersemitotal domination subdivision 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination subdivision numbers of graphs
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• On the semitotal domination number of line graphs
• Domination subdivision and domination multisubdivision numbers of graphs
• On matching and semitotal domination in graphs
• Domination and independence subdivision numbers of graphs
• Domination Subdivision Numbers
• Semitotal domination in claw-free cubic graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: Semitotal domination subdivision numbers of graphs