On the super connectivity of Kronecker products of graphs
From MaRDI portal
Publication:436343
DOI10.1016/j.ipl.2012.01.011zbMath1243.05208arXiv1105.1567OpenAlexW2004383618MaRDI QIDQ436343
Hechao Wang, Erfang Shan, Wei Wang
Publication date: 20 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.1567
Related Items (7)
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ The super connectivity of folded crossed cubes ⋮ The super edge connectivity of Kronecker product graphs ⋮ On the edge connectivity of direct products with dense graphs ⋮ The super connectivity of exchanged crossed cube ⋮ Connectivity of Kronecker products with complete multipartite graphs ⋮ Super connectivity of folded twisted crossed cubes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the Kronecker product of graphs
- Proof of a conjecture on connectivity of Kronecker product of graphs
- Lower bounds for the domination number and the total domination number of direct product graphs
- Super connectivity of Kronecker products of 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
- A finite automata approach to modeling the cross product of interconnection networks.
- The Kronecker Product of Graphs
- Circulants and their connectivities
- Independent sets in tensor graph powers
- Synthesis of reliable networks - a survey
- Hypercubes As Direct Products
- The Categorical Product of Graphs
This page was built for publication: On the super connectivity of Kronecker products of graphs