Domination critical graphs
From MaRDI portal
Publication:5906153
zbMath0401.05056MaRDI QIDQ5906153
Belmannu Devadas Acharya, H. B. Walikar
Publication date: 1979
Published in: National Academy Science Letters (Search for Journal in Brave)
Related Items (23)
The bondage number of random graphs ⋮ Edge criticality in graph domination ⋮ The k-power bondage number of a graph ⋮ The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs ⋮ Average distance and domination number ⋮ Connected certified domination edge critical and stable graphs ⋮ Critical concepts of restrained domination in signed graphs ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ RESTRAINED CRITICAL AND ABUNDANT SIGNED GRAPHS ⋮ Changing and unchanging isolate domination: Edge removal ⋮ Changing and unchanging domination: A classification ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Changing and unchanging of the domination number of a graph: path addition numbers ⋮ On packing and covering numbers of graphs ⋮ Extremal graphs domination insensitive to the removal of \(k\) edges ⋮ Construction of dominating sets of certain graphs ⋮ Critical concepts in domination ⋮ The cost of edge removal in graph domination ⋮ Changing and unchanging of the domination number of a graph ⋮ Changing and unchanging of the radius of a graph ⋮ Connected Domination ⋮ 2-domination dot-stable and dot-critical graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Domination critical graphs
