Outer complete fair domination in graphs

DOI10.1142/S1793830921501263zbMath1487.05200OpenAlexW3142937175MaRDI QIDQ5866027

L. Muthusubramanian, R. Sundareswaran, V. Swaminathan, D. Lalkshmanaraj

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

totally disconnectedfair dominationouter complete

Mathematics Subject Classification ID

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

Related Items (3)

Total outer connected vertex-edge domination ⋮ Secure equitability in graphs ⋮ Algorithmic aspects of domination number in nano topology induced by graph

Cites Work

• Fair domination in graphs
• The weighted perfect domination problem
• Fair domination number in cactus graphs
• Point-set domination number of a graph
• Nearly perfect sets in graphs
• Dominating sets in n‐cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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