On restricted edge-connectivity of lexicographic product graphs

DOI10.1080/00207160.2013.847182zbMath1305.05118OpenAlexW2010487624MaRDI QIDQ2935381

Weisheng Zhao, Jianping Ou

Publication date: 29 December 2014

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

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

zbMATH Keywords

restricted edge-connectivitylexicographic product graphsuper-restricted edge-connected

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Bounds for the Super Extra Edge Connectivity of Graphs ⋮ Vulnerability of super extra edge-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
• On optimizing edge connectivity of product graphs
• Some results on the lexicographic product of vertex-transitive graphs
• On super restricted edge-connectivity of edge-transitive graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• K-restricted edge connectivity for some interconnection networks
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Super restricted edge connected Cartesian product graphs
• The \(k\)-restricted edge connectivity of undirected Kautz graphs
• On computing a conditional edge-connectivity of a graph
• Hamiltonian decomposition of lexicographic product
• Results on the edge-connectivity of graphs
• The \(k\)-restricted edge-connectivity of a product of graphs
• On the edge-connectivity and restricted edge-connectivity of a product of graphs
• Super restricted edge connectivity of regular graphs
• On restricted edge-connectivity of graphs.

This page was built for publication: On restricted edge-connectivity of lexicographic product graphs