The restricted edge-connectivity of Kronecker product graphs
From MaRDI portal
Publication:5088083
DOI10.1142/S0129626419500129zbMATH Open1492.05079OpenAlexW2979066814WikidataQ127215941 ScholiaQ127215941MaRDI QIDQ5088083FDOQ5088083
Authors: Tianlong Ma, Jinling Wang, Mingzu Zhang
Publication date: 4 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626419500129
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- A note on the connectivity of Kronecker products of graphs
- On computing a conditional edge-connectivity of a graph
- A finite automata approach to modeling the cross product of interconnection networks.
- Computing the bipartite edge frustration of fullerene graphs
- Double graphs
- Independent sets in tensor graph powers
- Hypercubes As Direct Products
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Some remarks on the Kronecker product of graphs
- Connectivity of lexicographic product and direct product of graphs.
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- On edge connectivity of direct products of graphs
- On the connectivity of the direct product of graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Edge-connectivity of strong products of graphs
- Connectivity of strong products of graphs
- Title not available (Why is that?)
- Connectivity and super-connectivity of Cartesian product graphs.
- Reliability of interconnection networks modeled by Cartesian product digraphs
Cited In (6)
- Community detection in complex networks: from statistical foundations to data science applications
- The \(k\)-restricted edge-connectivity of a product of graphs
- The super restricted edge-connectedness of direct product graphs
- On restricted edge-connectivity of lexicographic product graphs
- Title not available (Why is that?)
- Connectivity of Kronecker products with complete multipartite graphs
This page was built for publication: The restricted edge-connectivity of Kronecker product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088083)