Coefficient of domination in graph

DOI10.1142/S1793830917500185MaRDI QIDQ5347251zbMATH OpenFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 4130427 (Why is no real title available?)
• scientific article; zbMATH DE number 4150229 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1792573 (Why is no real title available?)
• A recurrence template for several parameters in series-parallel graphs
• A survey of Nordhaus-Gaddum type relations
• Bounds on the average connectivity of a graph
• Fair domination in graphs
• Handbook of product graphs
• Inequalities between the domination number and the chromatic number of a graph
• On Complementary Graphs
• The average connectivity of a graph
• \(\alpha\)-domination

Cited in

(2)

• Connected domination value in graphs
• Equality co-neighborhood domination 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)