Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree

DOI<64::AID-NET7>3.0.CO;2-R 10.1002/1097-0037(200008)36:1<64::AID-NET7>3.0.CO;2-RzbMath0984.05054OpenAlexW2087232571MaRDI QIDQ4509384

D. A. Dimarco

Publication date: 10 January 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200008)36:1<64::aid-net7>3.0.co;2-r

zbMATH Keywords

realizabilitynetwork vulnerabilityline connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
• Vulnerability in graphs of diameter four
• Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
• Realizability ofp-point,q-line graphs with prescribed point connectivity, line connectivity, or minimum degree
• A Graph-Theoretic Approach to a Communications Problem
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree