A Generalization of Line Connectivity and Optimally Invulnerable Graphs
From MaRDI portal
Publication:4166783
DOI10.1137/0134052zbMath0386.05042OpenAlexW2034755180MaRDI QIDQ4166783
No author found.
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0134052
Related Items
Graphs with large generalized (edge-)connectivity, Bounding \(\ell\)-edge-connectivity in edge-connectivity, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, Path connectivity of line graphs and total graphs of complete bipartite graphs, Characterization of minimally \((2,l)\)-connected graphs, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity, Graphs and degree sequences. I, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, The 4-component connectivity of alternating group networks, Distribution of coefficients of rank polynomials for random sparse graphs, Constructing edge-disjoint Steiner paths in lexicographic product networks, Local-edge-connectivity in digraphs and oriented graphs, Reliability assessment of the Cayley graph generated by trees, The generalized connectivity of the line graph and the total graph for the complete bipartite graph, Generalized connectivity of some total graphs, Mixed connectivity properties of random graphs and some special graphs, Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs, Internally disjoint trees in the line graph and total graph of the complete bipartite graph
