Equitable fair domination in graphs

DOI10.1142/S179383092150083XzbMath1479.05287OpenAlexW3129750481MaRDI QIDQ5025163

D. Lakshmanaraj, V. Swaminathan, L. Muthusubramanian, R. Sundareswaran, Paluri S. V. Nataraj

Publication date: 1 February 2022

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

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

zbMATH Keywords

fair dominationequitable dominationequitable fair domination

Mathematics Subject Classification ID

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

Related Items (3)

2-Point set domination in separable graphs ⋮ 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
• Nearly perfect sets in graphs
• Dominating sets in n‐cubes
• Equitable Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable fair domination in graphs