The forcing nonsplit domination number of a graph

DOI10.11568/kjm.2021.29.1.1zbMath1468.05211OpenAlexW3147153299MaRDI QIDQ5006062

No author found.

Publication date: 12 August 2021

Full work available at URL: http://kkms.org/index.php/kjm/article/download/948/588

zbMATH Keywords

dominating setdomination numbernonsplit domination numberforcing domination numberforcing nonsplit domination number

Mathematics Subject Classification ID

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

Related Items (1)

THE FORCING CONVEX DOMINATION NUMBER OF A GRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonsplit domination number of a graph
• The relationship between \(k\)-forcing and \(k\)-power domination
• Total forcing versus total domination in cubic graphs
• A new lower bound on the domination number of a graph
• On the forcing geodetic and forcing Steiner numbers of a graph
• The forcing Steiner number of a graph
• The upper edge geodetic number and the forcing edge geodetic number of a graph
• On the forcing connected domination number of a graph

This page was built for publication: The forcing nonsplit domination number of a graph