Domination critical graphs

MaRDI QIDQ5906153zbMATH OpenFDO

Authors H. B. Walikar, B. D. Acharya

Publication date 1979

Published in National Academy Science Letters (Search for Journal in Brave)

zbMATH Keywords

Dominating SetDomination Critical GraphsDomination Number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited in

(24)

• On packing and covering numbers of graphs
• The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
• Average distance and domination number
• Changing and unchanging domination: A classification
• Changing and unchanging of the radius of a graph
• On bondage numbers of graphs: a survey with some comments
• Changing and unchanging of the domination number of a graph: path addition numbers
• Construction of dominating sets of certain graphs
• Critical concepts in domination
• Relations between edge removing and edge subdivision concerning domination number of a graph
• Changing and unchanging of the domination number of a graph
• The bondage number of random graphs
• Edge criticality in graph domination
• Changing and unchanging isolate domination: edge removal
• Connected domination
• The cost of edge removal in graph domination
• \(2\)-domination dot-stable and dot-critical graphs
• Critical concepts of restrained domination in signed graphs
• The \(k\)-power bondage number of a graph
• Connected certified domination edge critical and stable graphs
• RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS
• Extremal graphs domination insensitive to the removal of k edges
• Critical aspects in broadcast domination
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Domination critical graphs

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