Path-connectivity of lexicographic product graphs

DOI10.1080/00207160.2014.987762zbMath1338.05043OpenAlexW1977150107MaRDI QIDQ2804863

Yaping Mao

Publication date: 6 May 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.987762

zbMATH Keywords

packingconnectivitylexicographic productpath-connectivityinternally disjoint paths connecting \(S\)

Mathematics Subject Classification ID

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

Related Items (11)

The 3-path-connectivity of the \(k\)-ary \(n\)-cube ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ 3-path-connectivity of Cayley graphs generated by transposition trees ⋮ Path connectivity of line graphs and total graphs of complete bipartite graphs ⋮ Proper connection number of graph products ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Rainbow vertex-connection and graph products ⋮ The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products ⋮ Monochromatic connectivity and graph products ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ The 3-path-connectivity of the hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees: A survey
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• 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
• Note on the hardness of generalized connectivity
• A family of path properties for graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• 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
• Hamilton Paths in Grid Graphs
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Path-connectivity of lexicographic product graphs