THE MAXIMUM CONNECTIVITY OF A GRAPH
From MaRDI portal
Publication:5724439
DOI10.1073/pnas.48.7.1142zbMath0115.41003WikidataQ36395517 ScholiaQ36395517MaRDI QIDQ5724439
Publication date: 1962
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.48.7.1142
05Cxx: Graph theory
Related Items
Unnamed Item, The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds, Computing the Scattering Number of Graphs, Relationships between scattering number and other vulnerability parameters, Recent results in topological graph theory, An approximation algorithm for minimum-cost vertex-connectivity problems, Optimally reliable networks, A large class of maximally tough graphs, Validity of clusters formed by graph-theoretic cluster methods, Bounds on the size of graphs of given order and \(l\)-connectivity, Size, chromatic number, and connectivity, Multiplicative circulant networks. Topological properties and communication algorithms, Embedding trees in recursive circulants, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item