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

DOI10.1002/jgt.3190040404zbMath0455.05039OpenAlexW2022782103MaRDI QIDQ3903032

Charles L. Suffel, F. T. Boesch

Publication date: 1980

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190040404

zbMATH Keywords

degreeline connectivitycommunication network vulnerabilityrealizability of graphs with given parameters

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (3)

Communication aspects of networks based on geometric incidence relations ⋮ Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity ⋮ Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree

Cites Work

• Unnamed Item

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