The inverse strong nonsplit domination in graphs

DOI10.1142/S1793830921500725zbMath1478.05112OpenAlexW3112769034MaRDI QIDQ5025148

D. Kiruba Packiarani, Y. Therese Sunitha Mary

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500725

zbMATH Keywords

inverse strong nonsplit dominating setsinverse strong nonsplit domination number

Mathematics Subject Classification ID

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

Cites Work

• Inverse domination in graphs
• The strong nonsplit domination polynomial of some graphs
• Strong nonsplit dominating sets and strong nonsplit domination polynomial of complement of paths
• The nonsplit domination number of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: The inverse strong nonsplit domination in graphs