Domination Numbers in Graphs with Removed Edge or Set of Edges

DOI10.7151/DMGT.1259MaRDI QIDQ5316258zbMATH OpenOpenAlexFDO

Authors Magdalena Lemańska

Publication date 12 September 2005

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6d2462b570b1eb5edfa6982eb92a56f1e429831f

zbMATH Keywords

weakly connected domination number

Mathematics Subject Classification ID

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

Recommendations

• Domination parameters of a graph with deleted special subset of edges
• Domination parameters and edge-removal-critical graphs
• Outer-connected domination upon edge removal in graphs
• On edge domination numbers of graphs
• Total domination critical and stable graphs upon edge removal
• scientific article; zbMATH DE number 5762668
• On the domination number of some graphs
• On the domination number of some graphs
• Relations between edge removing and edge subdivision concerning domination number of a graph
• Edge removal-graphs of weak domination

Cited in

(9)

• Relations between edge removing and edge subdivision concerning domination number of a graph
• Special kinds of domination parameters of edge-deleted graphs.
• Weakly connected domination stable trees.
• scientific article; zbMATH DE number 989727 (Why is no real title available?)
• Connected domination
• Domination parameters of a graph with deleted special subset of edges
• The cost of edge removal in graph domination
• Changing of the domination number of a graph: edge multisubdivision and edge removal
• Extremal graphs domination insensitive to the removal of k edges

This page was built for publication: Domination Numbers in Graphs with Removed Edge or Set of Edges

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