Secure equitability in graphs

DOI10.1142/S1793830922500811MaRDI QIDQ6174164zbMATH OpenOpenAlexFDO

Authors L. Muthusubramanian, R. Sundareswaran, Venkata Swaminathan

Publication date 14 July 2023

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

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

zbMATH Keywords

equitable dominationsecure dominationsecure equitable domination

Mathematics Subject Classification ID

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

Recommendations

• Equalityof Secure Domination and Inverse Secure Domination Numbers
• scientific article; zbMATH DE number 2188623
• Equi independent equitable dominating sets in graphs
• Perfect secure domination in graphs
• Secure domination and secure total domination in graphs

Cites work

• Bibliography on domination in graphs and some basic definitions of domination parameters
• Complementary equitably totally disconnected equitable domination in graphs
• Connected monophonic domination in graphs
• Degree equitable chromatic number of a graph
• Degree equitable domination on graphs
• Equitable Coloring
• Equitable domination in graphs
• Equitable fair domination in graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2094533 (Why is no real title available?)
• scientific article; zbMATH DE number 6255026 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Inverse roman domination in graphs
• Irredundance, secure domination and maximum degree in trees
• Majority Roman domination in graphs
• Outer complete fair domination in graphs
• Restrained geodetic domination in graphs
• Signed total double Roman \(k\)-domination in graphs
• The Two-Triangle Case of the Acquaintance Graph
• Vertex Covers and Secure Domination in Graphs

Cited in

(5)

• Security in graphs
• Integer and fractional security in graphs
• About secure independence in graphs
• Secure equitable subdivision number of graphs
• Secure equitable domination in Cartesian product of graphs

This page was built for publication: Secure equitability in graphs

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