THE MAXIMUM CONNECTIVITY OF A GRAPH
From MaRDI portal
Publication:5724439
DOI10.1073/pnas.48.7.1142zbMath0115.41003OpenAlexW2125993726WikidataQ36395517 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
Related Items
Computing the Scattering Number of Graphs ⋮ Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices ⋮ Super Line-Connectivity Properties of Circulant Graphs ⋮ On k-leaf-connected graphs ⋮ Size, chromatic number, and connectivity ⋮ Do local majorities force a global majority? ⋮ CONNECTEDNESS INDEX OF UNCERTAIN GRAPH ⋮ Neighbor Rupture Degree of Harary Graphs ⋮ Network design and defence ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ Relationships between scattering number and other vulnerability parameters ⋮ Unnamed Item ⋮ Laplacian integral graphs in \(S(a, b)\) ⋮ Recent results in topological graph theory ⋮ Embedding trees in recursive circulants ⋮ On the number of spanning trees of circulant graphs ⋮ Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Optimally restricted edge connected elementary Harary graphs ⋮ On the extremal geometric-arithmetic graphs with fixed number of vertices having minimum degree ⋮ Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs ⋮ Uniformly optimally reliable graphs: A survey ⋮ Porous exponential domination in Harary graphs ⋮ A polyhedral approach to planar augmentation and related problems ⋮ Link Residual Closeness of Harary Graphs ⋮ Tenacity of a graph with maximum connectivity ⋮ Regular separable graphs of minimum order with given diameter ⋮ Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity ⋮ Network disruption and the common-enemy effect ⋮ On Minimum Critically n-Edge-Connected Graphs ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Counting and enumerating unlabeled split–indifference graphs ⋮ \(E\)-super vertex magic labelings of graphs ⋮ The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree ⋮ Euler index in uncertain graph ⋮ Using size for bounding expressions of graph invariants ⋮ Editing graphs into disjoint unions of dense clusters ⋮ A note on diameter and the degree sequence of a graph ⋮ Optimally reliable networks ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ A large class of maximally tough graphs ⋮ Extreme tenacity of graphs with given order and size ⋮ Optimal design and defense of networks under link attacks ⋮ An approximation algorithm for minimum-cost vertex-connectivity problems ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Distance spectra of graphs: a survey ⋮ Bounds on the \(Q\)-spread of a graph ⋮ Euler index of uncertain random graph: concepts and properties ⋮ On the eccentric distance sum of graphs ⋮ Approximating survivable networks with \(\beta \)-metric costs ⋮ Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree ⋮ An extremal problem on the connectivity of graphs ⋮ Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity ⋮ A survey of some network reliability analysis and synthesis results ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ Extremal graphs in connectivity augmentation ⋮ On \(k\)-connectivity problems with sharpened triangle inequality ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ On the distance signless Laplacian of a graph ⋮ Approximating Survivable Networks with Minimum Number of Steiner Points ⋮ Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd ⋮ Unnamed Item ⋮ On total domination vertex critical graphs of high connectivity ⋮ The Hamiltonian property of linear functions ⋮ On r-regular r-connected non-hamiltonian graphs ⋮ Semitotal domination of Harary graphs ⋮ Bounds on the size of graphs of given order and \(l\)-connectivity ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ On the extremal eccentric connectivity index of graphs ⋮ Minimally k-connected graphs of low order and maximal size ⋮ On the Steiner antipodal number of graphs ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs ⋮ The minimum number of edges and vertices in a graph with edge connectivity 𝑛 and 𝑚 𝑛-bonds ⋮ Unnamed Item ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems ⋮ Dynamic averaging load balancing on cycles
