Coefficient of domination in graph

DOI10.1142/S1793830917500185zbMATH Open1362.05095MaRDI QIDQ5347251FDOQ5347251

Angsuman Das

Publication date: 23 May 2017

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

Recommendations

• Equality co-neighborhood domination in graphs
• Cographic and global cographic domination number of a graph.
• scientific article; zbMATH DE number 7555760
• Domination parameters of a graph and its complement
• Upper whole domination in a graph

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)

Cites Work

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

Cited In (1)

• Connected domination value in graphs

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

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