The connectivity function of a graph

DOI10.1112/S0025579300003806MaRDI QIDQ5534025zbMATH OpenOpenAlexFDO

Authors L. 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

zbMATH Keywords

topology

Cites work

• Maximal Flow Through a Network

Cited in

(9)

• On minimally \((n,\lambda)\)-connected graphs
• On the mixed connectivity conjecture of Beineke and Harary
• Proportional component order network connectivity
• On the \(l\)-connectivity of a digraph
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• Mixed connectivity properties of random graphs and some special graphs
• Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
• Minimal separating sets of maximum size
• The complexity of mixed-connectivity

This page was built for publication: The connectivity function of a graph

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