The generalized 3-connectivity of Cartesian product
From MaRDI portal
Abstract: The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let be a nonempty set of vertices of , a collection of trees in is said to be internally disjoint trees connecting if and for any pair of distinct integers , where . For an integer with , the -connectivity of is the greatest positive integer for which contains at least internally disjoint trees connecting for any set of vertices of . Obviously, is the connectivity of . Sabidussi showed that for any two connected graphs and . In this paper, we first study the 3-connectivity of the Cartesian product of a graph and a tree , and show that if , then ; if , then . Furthermore, for any two connected graphs and with , if , then ; if , then . Our result could be seen as a generalization of Sabidussi's result. Moreover, all the bounds are sharp.
Recommendations
- The generalized 3-connectivity of graph products
- Generalized 3-edge-connectivity of Cartesian product graphs.
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- On generalized 3-connectivity of the strong product of graphs
Cited in
(45)- The Menger number of the strong product of graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- The generalized 3-connectivity of the Mycielskian of a graph
- On generalized 3-connectivity of the strong product of graphs
- Two kinds of generalized connectivity of dual cubes
- \(Z_3\)-connectivity of wreath product of graphs
- The generalized 4-connectivity of pancake graphs
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- The generalized 3-connectivity of two kinds of regular networks
- Two lower bounds for generalized 3-connectivity of Cartesian product graphs
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- The 4-set tree connectivity of \((n, k)\)-star networks
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- The generalized 3-connectivity of burnt pancake graphs and godan graphs
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- A solution to a conjecture on the generalized connectivity of graphs
- The generalized 4-connectivity of hierarchical cubic networks
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- The 4-set tree connectivity of hierarchical folded hypercube
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- The generalized 3-connectivity of graph products
- The minimum size of a graph with given tree connectivity
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- The generalized connectivity of data center networks
- Separation of Cartesian products of graphs into several connected components by the removal of vertices
- The Cartesian product of three triangles can be embedded into a subspace of genus 7
- Graphs with large generalized (edge-)connectivity
- Sharp upper bounds for generalized edge-connectivity of product graphs
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- On the difference of two generalized connectivities of a graph
- The generalized 4-connectivity of burnt pancake graphs
- Connectivity of generalized Cartesian product graphs
- The generalized connectivity of bubble-sort star graphs
- Path 3-(edge-)connectivity of lexicographic product graphs
- The generalized 4-connectivity of exchanged hypercubes
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- The generalized 4-connectivity of hypercubes
- On two generalized connectivities of graphs
- Generalized 3-edge-connectivity of Cartesian product graphs.
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity
- A result on the 3-generalized connectivity of a graph and its line graph
This page was built for publication: The generalized 3-connectivity of Cartesian product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403014)