Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity

DOI10.1016/0166-218X(81)90023-8zbMath0455.05038WikidataQ126551904 ScholiaQ126551904MaRDI QIDQ1149964

F. T. Boesch, Charles L. Suffel

Publication date: 1981

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

zbMATH Keywords

minimum degreemaximum degreegraph realizabilitypoint-connectivity

Mathematics Subject Classification ID

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

Related Items (2)

Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree ⋮ Graphs as models of communication network vulnerability: Connectivity and persistence

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Synthesis of reliable networks - a survey
• Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
• On minimum multigraphs with prescribed lower bounds on local line connectivities
• Line removal algorithms for graphs and their degree lists
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• On the Invulnerability of the Regular Complete k-Partite Graphs
• A general class of invulnerable graphs
• Lower bounds on the vulnerability of a graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity