A characterization of the edge connectivity of direct products of graphs
Author:
- Simon ŠpacapanSŠSimon Špacapan
- 1 June 2013
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (12) , 1385-1393
Abstract
No abstract availableAll Related Versions
Funding Information
- Ministry of Education and Science of Slovenia (P1-0297, J1-4106, L1-5168)
This publication has 16 references indexed in Scilit:
- Connectivity of Kronecker products byApplied Mathematics Letters, 2012
- Proof of a conjecture on connectivity of Kronecker product of graphsDiscrete Mathematics, 2011
- On edge connectivity of direct products of graphsInformation Processing Letters, 2011
- Super connectivity of Kronecker products of graphsInformation Processing Letters, 2010
- A note on the connectivity of Kronecker products of graphsApplied Mathematics Letters, 2009
- Connectivity of Cartesian products of graphsApplied Mathematics Letters, 2008
- Computing the bipartite edge frustration of fullerene graphsDiscrete Applied Mathematics, 2007
- Edge-connectivity of strong products of graphsDiscussiones Mathematicae Graph Theory, 2007
- Network bipartivityPhysical Review E, 2003
- The Kronecker product of graphsProceedings of the American Mathematical Society, 1962