Constructing edge-disjoint Steiner paths in lexicographic product networks

DOI10.1016/j.amc.2017.03.015zbMath1414.05171OpenAlexW2599340893MaRDI QIDQ1738072

Yaping Mao

Publication date: 29 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.03.015

zbMATH Keywords

packingedge-connectivitySteiner treelexicographic productedge-disjoint Steiner pathspath edge-connectivity

Mathematics Subject Classification ID

Trees (05C05) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Path 3-(edge-)connectivity of lexicographic product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with large generalized (edge-)connectivity
• On extremal graphs with internally disjoint Steiner trees
• The generalized 3-connectivity of star graphs and bubble-sort graphs
• On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
• Pendant tree-connectivity
• Path-connectivity in graphs
• On the \(\ell\)-connectivity of a graph
• The Steiner tree packing problem in VLSI design
• Reliable broadcasting in product networks
• Packing Steiner trees: A cutting plane algorithm and computational results
• Identifying codes of lexicographic product of graphs
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• A family of path properties for graphs
• Path-connectivity of lexicographic product graphs
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• A survey of gossiping and broadcasting in communication networks
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• Separation of graphs into three components by the removal of edges
• The Number of Independent Sets in a Grid Graph
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Hamilton Paths in Grid Graphs
• The generalized 3-connectivity of Lexicographic product graphs
• Optimum broadcasting and personalized communication in hypercubes
• The generalized 3-connectivity of Cartesian product graphs
• Lexicographic Products and the Power of Non-linear Network Coding

This page was built for publication: Constructing edge-disjoint Steiner paths in lexicographic product networks