The tree connectivity of regular complete bipartite graphs
From MaRDI portal
Recommendations
- The generalized connectivity of complete bipartite graphs.
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- The generalized connectivity of complete equipartition 3-partite graphs
- The minimum size of a graph with given tree connectivity
- Note on the rainbow k-connectivity of regular complete bipartite graphs.
Cited in
(15)- A result on the 3-generalized connectivity of a graph and its line graph
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Note on the hardness of generalized connectivity
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- On spanning disjoint paths in line graphs
- Graphs with large generalized (edge-)connectivity
- The generalized connectivity of complete bipartite graphs.
- Generalized connectivity of some total graphs
- A solution to a conjecture on the generalized connectivity of graphs
- On generalized 3-connectivity of the strong product of graphs
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- On the minimum size of graphs with given generalized connectivity
- The pendant-tree connectivity of some regular graphs
This page was built for publication: The tree connectivity of regular complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012590)
