The generalized 3-connectivity of Lexicographic product graphs
From MaRDI portal
Publication:5167713
zbMath1294.05105arXiv1307.2007MaRDI QIDQ5167713
Publication date: 1 July 2014
Full work available at URL: https://arxiv.org/abs/1307.2007
packingconnectivitySteiner treelexicographic productgeneralized connectivityinternally disjoint Steiner trees
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On the maximum and minimum sizes of a graph with given \(k\)-connectivity, Graphs with large generalized (edge-)connectivity, A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs, Path 3-(edge-)connectivity of lexicographic product graphs, On two generalized connectivities of graphs, On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices, The 4-set tree connectivity of \((n, k)\)-star networks, 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 minimum size of a graph with given tree connectivity, The generalized 3-connectivity of graph products, Constructing edge-disjoint Steiner paths in lexicographic product networks, Tree connectivities of Cayley graphs on abelian groups with small degrees, A solution to a conjecture on the generalized connectivity of graphs, On the difference of two generalized connectivities of a graph, The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants, On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, Structural Properties of Generalized Exchanged Hypercubes, Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs, Two lower bounds for generalized 3-connectivity of Cartesian product graphs, Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs, A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
