Coefficient of domination in graph

DOI10.1142/S1793830917500185zbMath1362.05095MaRDI QIDQ5347251

Angsuman Das

Publication date: 23 May 2017

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

zbMATH Keywords

dominating setgraph invariantNordhaus-Gaddum type inequalities

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (1)

Connected domination value in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair domination in graphs
• Inequalities between the domination number and the chromatic number of a graph
• A recurrence template for several parameters in series-parallel graphs
• Bounds on the average connectivity of a graph
• The average connectivity of a graph
• A survey of Nordhaus-Gaddum type relations
• \(\alpha\)-domination
• On Complementary Graphs

This page was built for publication: Coefficient of domination in graph