Outer complete fair domination in graphs

DOI10.1142/S1793830921501263MaRDI QIDQ5866027zbMATH OpenOpenAlexFDO

Authors Venkata Swaminathan, R. Sundareswaran, D. Lalkshmanaraj, L. Muthusubramanian

Publication date 10 June 2022

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

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

zbMATH Keywords

fair dominationouter completetotally disconnected

Mathematics Subject Classification ID

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

Recommendations

• Equitable fair domination in graphs
• Fair domination in graphs
• Equitably strong non-split equitable domination in graphs
• On strong and weak domination numbers in graphs
• The inverse strong nonsplit domination in graphs

Cites work

• Dominating sets in n‐cubes
• Fair domination in graphs
• Fair domination number in cactus graphs
• scientific article; zbMATH DE number 5542737 (Why is no real title available?)
• scientific article; zbMATH DE number 5553874 (Why is no real title available?)
• scientific article; zbMATH DE number 91051 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• Nearly perfect sets in graphs
• Perfect \(k\)-domination in graphs
• Point-set domination number of a graph
• The weighted perfect domination problem
• Trees and unicyclic graphs with large fair domination number

Cited in

(5)

• Total outer connected vertex-edge domination
• Secure equitability in graphs
• Algorithmic aspects of domination number in nano topology induced by graph
• Fair detour domination of graphs
• Locating fair domination in graphs

This page was built for publication: Outer complete fair domination in graphs

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