THE MAXIMUM CONNECTIVITY OF A GRAPH

DOI10.1073/pnas.48.7.1142zbMath0115.41003WikidataQ36395517 ScholiaQ36395517MaRDI QIDQ5724439

Frank Harary

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

zbMATH Keywords

graph theory

Mathematics Subject Classification ID

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, Laplacian integral graphs in \(S(a, b)\), Bounds on the \(Q\)-spread of a graph, Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity, On \(k\)-connectivity problems with sharpened triangle inequality, On total domination vertex critical graphs of high connectivity, Minimally k-connected graphs of low order and maximal size, On k-leaf-connected graphs, Do local majorities force a global majority?, Regular separable graphs of minimum order with given diameter, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity, 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, The Hamiltonian property of linear functions, Embedding trees in recursive circulants, Unnamed Item, On the number of spanning trees of circulant graphs, An extremal problem on the connectivity of graphs, Super Line-Connectivity Properties of Circulant Graphs, On Minimum Critically n-Edge-Connected Graphs, Unnamed Item, On r-regular r-connected non-hamiltonian graphs, Unnamed Item, Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, Unnamed Item