A Generalization of Line Connectivity and Optimally Invulnerable Graphs
From MaRDI portal
Cited in
(20)- Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
- The 4-component connectivity of alternating group networks
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Characterization of minimally (2,l)-connected 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
- 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
- Bounding \(\ell\)-edge-connectivity in edge-connectivity
- Local-edge-connectivity in digraphs and oriented graphs
- Graphs with large generalized (edge-)connectivity
- Graphs and degree sequences. I
- Generalized connectivity of some total graphs
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
- Path connectivity of line graphs and total graphs of complete bipartite graphs
- l-connectivity, l-edge-connectivity and spectral radius of graphs
- Distribution of coefficients of rank polynomials for random sparse graphs
- Link fault tolerance of the Cartesian product power graph ( K₉ - C₉ )^n on strongly Menger-edge-connectivity and component edge-connectivity
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
This page was built for publication: A Generalization of Line Connectivity and Optimally Invulnerable Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166783)
