Path-connectivity of lexicographic product graphs

DOI10.1080/00207160.2014.987762zbMATH Open1338.05043OpenAlexW1977150107MaRDI QIDQ2804863FDOQ2804863

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

Recommendations

• On the path-connectivity of lexicographic product graphs.
• Path 3-(edge-)connectivity of lexicographic product graphs
• Connectivity of lexicographic product and direct product of graphs.
• On restricted edge-connectivity of lexicographic product graphs
• The generalized 3-connectivity of lexicographic product graphs
• Lexicographic product of extendable graphs
• The generalized 3-edge-connectivity of lexicographic product graphs
• Connectivity of Cartesian product graphs
• ON CONNECTED TOTAL DOMINATION POLYNOMIAL OF SOME LEXICOGRAPHIC PRODUCT GRAPHS
• The connectivity of generalized graph products

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A survey of gossiping and broadcasting in communication networks
• Hamilton Paths in Grid Graphs
• Spanning trees: A survey
• The Number of Independent Sets in a Grid Graph
• Pendant tree-connectivity
• Path-connectivity in graphs
• On the \(\ell\)-connectivity of a graph
• The Steiner tree packing problem in VLSI design
• Packing Steiner trees: A cutting plane algorithm and computational results
• Note on the hardness of generalized connectivity
• Topics in structural graph theory
• Title not available (Why is that?)
• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On the spanning tree packing number of a graph: A survey
• Reliable broadcasting in product networks
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• A family of path properties for graphs

Cited In (14)

• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• Reliability analysis of exchanged hypercubes based on the path connectivity
• The 3-path-connectivity of the star graphs
• On restricted 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
• Monochromatic connectivity 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
• Rainbow vertex-connection and graph products
• Path 3-(edge-)connectivity of lexicographic product graphs
• Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree
• The 3-path-connectivity of the hypercubes
• Proper connection number of graph products

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804863)