Secure equitable domination in Cartesian product of graphs

DOI10.1142/S1793830925501289MaRDI QIDQ7364881zbMATH OpenFDO

Authors Annie Alex, Veerasamy Sangeetha

Publication date 2 October 2026

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

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

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• Co-secure and secure domination in graphs
• Degree equitable domination on graphs
• Equitable domination in graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 6255026 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• On secure domination in graphs
• Secure equitability in graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The secure domination number of Cartesian products of small graphs with paths and cycles

This page was built for publication: Secure equitable domination in Cartesian product of graphs

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