The connectivity function of a graph
From MaRDI portal
Publication:5534025
DOI10.1112/S0025579300003806zbMath0153.25901OpenAlexW2104968017MaRDI QIDQ5534025
Lowell W. Beineke, Frank Harary
Publication date: 1967
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0025579300003806
Related Items (7)
Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices ⋮ Minimal separating sets of maximum size ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Mixed connectivity properties of random graphs and some special graphs ⋮ The complexity of mixed-connectivity ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ On the \(l\)-connectivity of a digraph
Cites Work
This page was built for publication: The connectivity function of a graph
