Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
From MaRDI portal
Publication:5374226
zbMath1383.05055arXiv1508.07202MaRDI QIDQ5374226
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1508.07202
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Connectivity of Cartesian products of graphs
- Pendant tree-connectivity
- On the \(\ell\)-connectivity of a graph
- The multi-tree approach to reliability in distributed networks
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
- The Steiner tree packing problem in VLSI design
- Reliable broadcasting in product networks
- Packing Steiner trees: A cutting plane algorithm and computational results
- Note on the hardness of generalized connectivity
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- The minimal size of a graph with given generalized 3-edge-connectivity
- On the generalized (edge-)connectivity of graphs
- Generalized Connectivity of Graphs
- Rainbow trees in graphs and generalized connectivity
- A survey of gossiping and broadcasting in communication networks
- The Number of Independent Sets in a Grid Graph
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- The generalized 3-connectivity of Lexicographic product graphs
- Optimum broadcasting and personalized communication in hypercubes
- The generalized 3-connectivity of Cartesian product graphs
This page was built for publication: Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
