Local edge domination critical graphs

DOI10.1016/0012-365X(95)00222-IzbMath0870.05035OpenAlexW1966839193MaRDI QIDQ1356421

Henda C. Swart, Michael A. Henning, Ortrud R. Oellermann

Publication date: 9 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00222-i

zbMATH Keywords

upper boundscharacterizationsdiameterdominating setdomination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (2)

A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ Erratum to: [``Local edge domination critical graphs, Discrete Math. 161, No.\,1--3, 175--184 (1996; Zbl 0870.05035)]

Cites Work

• Unnamed Item
• Unnamed Item
• Critical concepts in domination
• Hamiltonian properties of domination-critical graphs
• The diameter of domination k‐critical graphs
• Domination critical graphs

This page was built for publication: Local edge domination critical graphs