On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
From MaRDI portal
Publication:2410034
DOI10.1007/s10878-016-0075-zzbMath1410.05107OpenAlexW2520881031MaRDI QIDQ2410034
Haina Sun, Wei Li, Yongtang Shi, Shasha Li
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0075-z
Related Items (16)
The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs ⋮ The Generalized Connectivity of Data Center Networks ⋮ The 3-path-connectivity of the \(k\)-ary \(n\)-cube ⋮ The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles ⋮ Path connectivity of line graphs and total graphs of complete bipartite graphs ⋮ Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph ⋮ A result on the 3-generalized connectivity of a graph and its line graph ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The generalized 4-connectivity of exchanged hypercubes ⋮ The generalized connectivity of the line graph and the total graph for the complete bipartite graph ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ Generalized connectivity of some total graphs ⋮ Two lower bounds for generalized 3-connectivity of Cartesian product graphs ⋮ The generalized 4-connectivity of pancake graphs ⋮ Internally disjoint trees in the line graph and total graph of the complete bipartite graph
Cites Work
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Path-connectivity in graphs
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- Note on the hardness of generalized connectivity
- The generalized connectivity of complete equipartition 3-partite graphs
- Rainbow trees in graphs and generalized connectivity
- The minimal size of a graph with generalized connectivity $\kappa_3 = 2$
- The generalized connectivity of complete bipartite graphs
- The generalized 3-connectivity of random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)