Pendant tree-connectivity
From MaRDI portal
Recommendations
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- Connectivity keeping trees in \(k\)-connected graphs
- Spanning \(k\)-trees of \(n\)-connected graphs
- scientific article; zbMATH DE number 6770102
Cites work
- scientific article; zbMATH DE number 3743278 (Why is no real title available?)
- 2-linked graphs
- A theorem on n-connected graphs
- Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
- Extensions of Menger's Theorem†
- Graph decomposition with applications to subdivisions and path systems modulo k
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- On the existence of certain disjoint arcs in graphs
- Path-connectivity in graphs
Cited in
(51)- The 3-path-connectivity of the \(k\)-ary \(n\)-cube
- On the minimum size of graphs with given generalized connectivity
- The generalized 3-connectivity of the Mycielskian of a graph
- Directed Steiner tree packing and directed tree connectivity
- On generalized 3-connectivity of the strong product of graphs
- Steiner tree packing number and tree connectivity
- The generalized 4-connectivity of pancake graphs
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
- The 4-set tree connectivity of \((n, k)\)-star networks
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Structural properties of generalized exchanged hypercubes
- Extremal results for directed tree connectivity
- 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
- \(k\)-tree connectivity of line graphs
- Path-connectivity of lexicographic product graphs
- Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- 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
- Directed cycle \(k\)-connectivity of complete digraphs and complete regular bipartite digraphs
- Reliability analysis of exchanged hypercubes based on the path connectivity
- The 3-path-connectivity of the star graphs
- A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- Strong subgraph connectivity of digraphs
- Path connectivity of line graphs and total graphs of complete bipartite graphs
- 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
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- Tree connectivities of Cayley graphs on abelian groups with small degrees
- On the difference of two generalized connectivities of a graph
- On tree-connectivity and path-connectivity of graphs
- Construction of the developing connecting tree
- Path-connectivity in graphs
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
- The generalized connectivity of the line graph and the total graph for the complete bipartite graph
- Path 3-(edge-)connectivity of lexicographic product graphs
- Generalized connectivity of some total graphs
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- On two generalized connectivities of graphs
- Cycle-connected mixed graphs and related problems
- The \(\kappa_k\)-connectivity of line graphs
- scientific article; zbMATH DE number 3861202 (Why is no real title available?)
- The 4-component connectivity of alternating group networks
- Neighbor connectivity of pancake graphs and burnt pancake graphs
- A result on the 3-generalized connectivity of a graph and its line graph
This page was built for publication: Pendant tree-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059087)