Pendant tree-connectivity

DOI10.1016/0095-8956(85)90083-8MaRDI QIDQ1059087zbMATH OpenOpenAlexFDO

Authors Michael Hager

Publication date 1985

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(85)90083-8

zbMATH Keywords

edge-disjoint treestree-connectivity

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Review text

See the preview in Zbl 0542.05042.

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

• 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
• scientific article; zbMATH DE number 3743278 (Why is no real title available?)
• 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

(68)

• Path-connectivity in graphs
• The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
• On two generalized connectivities of graphs
• A result on the 3-generalized connectivity of a graph and its line graph
• The 4-component connectivity of alternating group networks
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• Steiner tree packing number and tree connectivity
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
• The generalized connectivity of the line graph and the total graph for the complete bipartite graph
• The generalized 3-connectivity of the Mycielskian of a graph
• Strong subgraph connectivity of digraphs
• On tree-connectivity and path-connectivity of graphs
• Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
• Neighbor connectivity of pancake graphs and burnt pancake graphs
• The generalized 4-connectivity of pancake graphs
• Internally disjoint trees in the line graph and total graph of the complete bipartite graph
• Extremal results for directed tree connectivity
• Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
• Path 3-(edge-)connectivity of lexicographic product graphs
• The \(\kappa_k\)-connectivity of line graphs
• The 4-set tree connectivity of (n, k)-star networks
• The generalized 4-connectivity of hierarchical cubic networks
• The reliability analysis based on the generalized connectivity in balanced hypercubes
• The minimum size of a graph with given tree connectivity
• \(k\)-tree connectivity of line 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\)
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
• Path-connectivity of lexicographic product graphs
• scientific article; zbMATH DE number 3861202 (Why is no real title available?)
• Sharp upper bounds for generalized edge-connectivity of product graphs
• Graphs with large generalized (edge-)connectivity
• Structural properties of generalized exchanged hypercubes
• Generalized connectivity of some total graphs
• Tree connectivities of Cayley graphs on abelian groups with small degrees
• A cut tree representation for pendant pairs
• On the difference of two generalized connectivities of a graph
• On generalized 3-connectivity of the strong product of graphs
• Constructing internally disjoint pendant Steiner trees in Cartesian product networks
• A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
• Cycle-connected mixed graphs and related problems
• Directed Steiner tree packing and directed tree connectivity
• Construction of the developing connecting tree
• Path connectivity of line graphs and total graphs of complete bipartite graphs
• Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
• On the minimum size of graphs with given generalized connectivity
• The 3-path-connectivity of the star graphs
• Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
• Reliability analysis of exchanged hypercubes based on the path connectivity
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• The generalized 3-connectivity of BCCC data center networks
• Neighbor connectivity of bubble-sort star graphs
• The pendant-tree connectivity of some regular graphs
• The lower bounds of 4-tree connectivity of Cartesian product graphs
• The directed pendant-tree 3-connectivity of symmetric compositions
• Packing internally disjoint Steiner paths of modified bubble-sort networks
• Neighbor connectivity of hierarchical pancake networks
• Conditional matroidal edge connectivity of Cayley graphs
• \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\)
• Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
• The generalized 3-connectivity and 4-connectivity of crossed cube
• k-path-edge-connectivity of the complete balanced bipartite graph
• k-path-connectivity of balanced hypercubes for k = 3, 4
• Star and h-step-limited star connectivity of exchanged hypercubes
• The generalized 4-connectivity of bubble-sort graphs
• The generalized 4-connectivity of a family of regular graphs
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices

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)