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

DOI10.1016/0166-218X(81)90023-8MaRDI QIDQ1149964zbMATH OpenWikidataFDO

Authors F. T. Boesch, Charles L. Suffel

Publication date 1981

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

Full work available at URL https://doi.org/10.1016/0166-218X(81)90023-8

zbMATH Keywords

graph realizabilitymaximum degreeminimum degreepoint-connectivity

Mathematics Subject Classification ID

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

Cites work

• A general class of invulnerable graphs
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• scientific article; zbMATH DE number 3441964 (Why is no real title available?)
• Line removal algorithms for graphs and their degree lists
• Lower bounds on the vulnerability of a graph
• On minimum multigraphs with prescribed lower bounds on local line connectivities
• On the Invulnerability of the Regular Complete k-Partite Graphs
• Parallel concepts in graph theory
• Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
• Synthesis of reliable networks - a survey
• THE MAXIMUM CONNECTIVITY OF A GRAPH

Cited in

(2)

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

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

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