Total $k$-distance domination critical graphs

DOI10.22108/toc.2016.11972zbMath1463.05411OpenAlexW2205459017MaRDI QIDQ5134449

Ahangar Hossein Abdollahzadeh, Doost Ali Mojdeh, A. Sayed-Khalkhali, Yan-Cai Zhao

Publication date: 16 November 2020

Full work available at URL: https://journals.ui.ac.ir/article_11972_e981fb3fc30d07aadf6dd763425eb32b.pdf

zbMATH Keywords

distance dominationtotal \(k\)-distance dominating settotal \(k\)-distance domination-critical

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Efficient \(k\)-distance dominating set in Cayley graphs ⋮ On the distance domination number of bipartite graphs ⋮ On disjunctive domination in graphs

Cites Work

• On the existence problem of the total domination vertex critical graphs
• On an open problem concerning total domination critical graphs
• The diameter of total domination vertex critical graphs
• Distance domination-critical graphs
• On the total domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total $k$-distance domination critical graphs