Graphs with large generalized 3-connectivity
From MaRDI portal
Publication:4982923
zbMath1324.05105arXiv1201.2983MaRDI QIDQ4982923
Hengzhe Li, Yuefang Sun, Yaping Mao, Xue Liang Li
Publication date: 13 April 2015
Full work available at URL: https://arxiv.org/abs/1201.2983
Related Items (25)
On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ The Generalized Connectivity of Data Center Networks ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles ⋮ The generalized 3-connectivity of burnt pancake graphs and godan graphs ⋮ On two generalized connectivities of graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ A result on the 3-generalized connectivity of a graph and its line graph ⋮ The generalized 4-connectivity of hierarchical cubic networks ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ Two kinds of generalized connectivity of dual cubes ⋮ The minimum size of a graph with given tree connectivity ⋮ The generalized 3-connectivity of graph products ⋮ The generalized 3-connectivity of star graphs and bubble-sort graphs ⋮ The generalized 3-connectivity of two kinds of regular networks ⋮ On the difference of two generalized connectivities of a graph ⋮ The generalized 4-connectivity of exchanged hypercubes ⋮ The Generalized Connectivity of Bubble-Sort Star Graphs ⋮ Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs ⋮ Generalized 4-connectivity of hierarchical star networks ⋮ The generalized 4-connectivity of pancake graphs ⋮ Internally disjoint trees in the line graph and total graph of the complete bipartite graph
This page was built for publication: Graphs with large generalized 3-connectivity
