scientific article; zbMATH DE number 5844243

MaRDI QIDQ3070288zbMATH OpenFDO

Authors D. A. Dimarco

Publication date 2 February 2011

zbMATH Keywords

communication network vulnerabilityextremal graph problemsextremal problemsline connectivitypoint connectivityundirected graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Realizability of connected, separable, p-point, q-line graphs with prescribed minimum degree and line connectivity
• scientific article; zbMATH DE number 2188466
• Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
• scientific article; zbMATH DE number 2188360
• scientific article; zbMATH DE number 1749657
• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree
• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. II
• Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III.
• scientific article; zbMATH DE number 3979100
• Edge realizability of connected simple graphs

Cited in

(5)

• Realizability of connected, separable, p-point, q-line graphs with prescribed minimum degree and line connectivity
• Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
• scientific article; zbMATH DE number 1749657 (Why is no real title available?)
• scientific article; zbMATH DE number 2188360 (Why is no real title available?)
• scientific article; zbMATH DE number 2188466 (Why is no real title available?)

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 Q3070288)