The Restricted Edge-Connectivity of Kronecker Product Graphs
From MaRDI portal
Publication:5088083
DOI10.1142/S0129626419500129zbMath1492.05079OpenAlexW2979066814WikidataQ127215941 ScholiaQ127215941MaRDI QIDQ5088083
Jinling Wang, Tianlong Ma, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the Kronecker product of graphs
- Connectivity of Cartesian product graphs
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Connectivity of Cartesian products of graphs
- 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.
- On edge connectivity of direct products of graphs
- Connectivity of strong products of graphs
- Computing the bipartite edge frustration of fullerene graphs
- Double graphs
- Independent sets in tensor graph powers
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Hypercubes As Direct Products
- Edge-connectivity of strong products of graphs
This page was built for publication: The Restricted Edge-Connectivity of Kronecker Product Graphs