Note: The diameter of edge domination critical graphs

DOI10.1002/NET.3230240408MaRDI QIDQ4303632zbMATH OpenOpenAlexFDO

Authors Matteo Paris

Publication date 27 September 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240408

zbMATH Keywords

diameterdomination numberedge critical graphsedge domination critical graphupper bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• The diameter of domination k‐critical graphs
• Upper bound on the diameter of a domination dot-critical graph
• The diameter of connected domination critical graphs.
• Upper bounds on the diameter of domination dot-critical graphs with given connectivity

Cites work

• Critical concepts in domination

Cited in

(8)

• Diameter-essential edges in a graph
• Edge-wide-diameter of graphs with diameter d
• Upper bound on the diameter of a domination dot-critical graph
• scientific article; zbMATH DE number 6096635 (Why is no real title available?)
• The diameter of paired-domination vertex critical graphs
• scientific article; zbMATH DE number 1222089 (Why is no real title available?)
• scientific article; zbMATH DE number 1506509 (Why is no real title available?)
• Diameter-vital edges in a graph

This page was built for publication: Note: The diameter of edge domination critical graphs

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