Secure domination number of generalized thorn graphs

DOI10.22098/JHS.2025.15658.1036MaRDI QIDQ6895677zbMATH OpenFDO

Authors Gisha Saraswathy, Manju K. Menon

Publication date 25 November 2025

Published in Journal of Hyperstructures (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.22098/JHS.2025.15658.1036

zbMATH Keywords

generalized thorn pathsKragujevac treessecure domination numberthorn graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Cites work

• A linear algorithm for secure domination in trees
• A textbook of graph theory
• scientific article; zbMATH DE number 6704583 (Why is no real title available?)
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Irredundance, secure domination and maximum degree in trees
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.
• On hop domination number of some generalized graph structures
• Secure domination critical graphs
• Secure domination parameters of Halin graph with perfect k-ary tree
• The complexity of secure domination problem in graphs
• The secure domination number of Cartesian products of small graphs with paths and cycles
• Variants of the domination number for flower snarks
• Vertex Covers and Secure Domination in Graphs

This page was built for publication: Secure domination number of generalized thorn graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895677)