scientific article; zbMATH DE number 2190093

MaRDI QIDQ5462149zbMATH OpenFDO

Authors Michael Ackerman, Ralph Faudree

Publication date 1 August 2005

zbMATH Keywords

boundsconnectivitydiametervertex deletion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Extremal graphs of diameter at most 6 after deleting any vertex
• Publication:4723767
• Graphs with small diameter after edge deletion
• scientific article; zbMATH DE number 4008432
• Diameter vulnerability of graphs by edge deletion

Cited in

(5)

• The effect of vertex and edge deletion on the edge metric dimension of graphs
• Effect of vertex deletion on the weak Roman domination number of a graph
• Modifying a graph using vertex elimination
• scientific article; zbMATH DE number 3995718 (Why is no real title available?)
• The effect of edge and vertex deletion on omega invariant

This page was built for publication:

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