Path-connectivity of lexicographic product graphs

DOI10.1080/00207160.2014.987762MaRDI QIDQ2804863zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

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

Cited in

(16)

• Path 3-(edge-)connectivity of lexicographic product graphs
• Monochromatic connectivity and graph products
• On the path-connectivity of lexicographic product graphs.
• The 3-path-connectivity of the \(k\)-ary \(n\)-cube
• Reliability analysis of exchanged hypercubes based on the path connectivity
• The 3-path-connectivity of the star graphs
• The 3-path-connectivity of the hypercubes
• The \(k\)-independence number of graph products
• Rainbow vertex-connection and graph products
• Proper connection number of graph products
• 3-path-connectivity of Cayley graphs generated by transposition trees
• Path connectivity of line graphs and total graphs of complete bipartite graphs
• Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree
• On restricted edge-connectivity of lexicographic product graphs
• On the path edge-connectivity of graphs.
• Constructing edge-disjoint Steiner paths in lexicographic product networks

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)