Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
From MaRDI portal
Publication:279219
DOI10.1016/J.DISC.2015.10.036zbMath1334.05130OpenAlexW2180956479MaRDI QIDQ279219
Alpay Kırlangiç, Gülnaz Boruzanlı Ekinci
Publication date: 27 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.036
Related Items (4)
On the reliability of generalized Petersen graphs ⋮ The super-connectivity of Kneser graphs ⋮ The super edge connectivity of Kronecker product graphs ⋮ Connectivity and super connectivity of folded hypercube-like networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on connectivity of Kronecker product of graphs
- On the super connectivity of Kronecker products of graphs
- Super connectivity of Kronecker products of graphs
- The super connectivity of augmented cubes
- Vertex vulnerability parameters of Kronecker products of complete graphs
- A note on the connectivity of Kronecker products of graphs
- Super connectivity of line graphs
- A finite automata approach to modeling the cross product of interconnection networks.
- Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
- Super connectivity of balanced hypercubes
- Connectivity of Direct Products of Graphs
- The Kronecker Product of Graphs
- Independent sets in tensor graph powers
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On super connectivity of Cartesian product graphs
- Conditional connectivity
- Reliability Evaluation of BC Networks
- Hypercubes As Direct Products
- The Categorical Product of Graphs
This page was built for publication: Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
