On restricted edge-connectivity of lexicographic product graphs
From MaRDI portal
Publication:2935381
DOI10.1080/00207160.2013.847182zbMATH Open1305.05118OpenAlexW2010487624MaRDI QIDQ2935381FDOQ2935381
Authors: 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
Recommendations
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Path-connectivity of lexicographic product graphs
- On restricted edge connectivity of regular Cartesian product graphs
- On the path-connectivity of lexicographic product graphs.
- The \(k\)-restricted edge-connectivity of a product of graphs
- On restricted edge connectivity of strong product graphs.
- On restricted connectivity of some Cartesian product graphs
- The restricted edge-connectivity of Kronecker product graphs
- The generalized 3-edge-connectivity of lexicographic product graphs
- scientific article; zbMATH DE number 7117009
Cites Work
- The \(k\)-restricted edge-connectivity of a product of graphs
- Handbook of product graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Some results on the lexicographic product of vertex-transitive graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- K-restricted edge connectivity for some interconnection networks
- On optimizing edge connectivity of product graphs
- Title not available (Why is that?)
- On restricted edge-connectivity of graphs.
- Super restricted edge connected Cartesian product graphs
- Super restricted edge connectivity of regular graphs
- On super restricted edge-connectivity of edge-transitive graphs
- The \(k\)-restricted edge connectivity of undirected Kautz graphs
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Results on the edge-connectivity of graphs
- Hamiltonian decomposition of lexicographic product
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
Cited In (9)
- The reliability of lexicographic product digraphs
- On restricted edge connectivity of strong product graphs.
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Vulnerability of super extra edge-connected graphs
- Path-connectivity of lexicographic product graphs
- Bounds for the super extra edge connectivity of graphs
- The super restricted edge-connectedness of direct product graphs
- Connectivity of lexicographic product and direct product of graphs.
- Path 3-(edge-)connectivity of lexicographic product graphs
This page was built for publication: On restricted edge-connectivity of lexicographic product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935381)
