Outer complete fair domination in graphs

DOI10.1142/S1793830921501263zbMATH Open1487.05200OpenAlexW3142937175MaRDI QIDQ5866027FDOQ5866027

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

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

zbMATH Keywords

totally disconnectedfair dominationouter complete

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fair domination in graphs
• Nearly perfect sets in graphs
• Title not available (Why is that?)
• The weighted perfect domination problem
• Title not available (Why is that?)
• Dominating sets in n‐cubes
• Point-set domination number of a graph
• Title not available (Why is that?)
• Perfect \(k\)-domination in graphs
• Fair domination number in cactus graphs
• Trees and unicyclic graphs with large fair domination number
• Title not available (Why is that?)

Cited In (3)

• Algorithmic aspects of domination number in nano topology induced by graph
• Total outer connected vertex-edge domination
• Secure equitability 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)