scientific article; zbMATH DE number 7785923

DOI10.14317/jami.2023.839MaRDI QIDQ6145882

N. Parvathi, Unnamed Author

Publication date: 9 January 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treedominating setHalin graphsecure dominating setperfect \(k\)-ary tree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of trees with equal independent domination and secure domination numbers
• Secure domination critical graphs
• Secure domination in proper interval graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• On secure domination in graphs
• Secure domination in cographs
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• Construction of Halin graph with perfect k-ary tree and its independent domination number
• Domination-related parameters in rooted product graphs

This page was built for publication: