An extremal problem for edge domination insensitive graphs

DOI10.1016/0166-218X(88)90058-3zbMath0638.05031OpenAlexW2071361850MaRDI QIDQ1099185

Robert C. Brigham, Ronald D. Dutton

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90058-3

zbMATH Keywords

dominating setdomination numberedge minimal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (13)

Theg-network and its inherent fault tolerant properties ⋮ Connected certified domination edge critical and stable graphs ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ Changing and unchanging domination: A classification ⋮ Unnamed Item ⋮ Extremal graphs domination insensitive to the removal of \(k\) edges ⋮ Graphs whose vertex independence number is unaffected by single edge addition or deletion ⋮ Changing and unchanging of the radius of a graph ⋮ Connected Domination ⋮ 2-domination dot-stable and dot-critical graphs ⋮ All My Favorite Conjectures Are Critical ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The edge-to-edge geodetic domination number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• Vertex domination-critical graphs
• Domination critical graphs

This page was built for publication: An extremal problem for edge domination insensitive graphs