Fault diameter of Cartesian product graphs
Authors:
- Min XuMXMin Xu
- Jun-Ming XuJXJun-Ming Xu
- Xin-Min HouXHXin-Min Hou
- 1 March 2005
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 93 (5) , 245-248
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On connectivity of the Cartesian product of two graphsApplied Mathematics and Computation, 1999
- WIDE DIAMETERS OF BUTTERFLY NETWORKSTaiwanese Journal of Mathematics, 1999
- Connectivity of cartesian product digraphs and fault-tolerant routings of generalized hypercubeApplied Mathematics-A Journal of Chinese Universities, 1998
- Fault-tolerant routing in circulant networks and cycle prefix networksAnnals of Combinatorics, 1998
- On the Rabin number problemNetworks, 1997
- The cross product of interconnection networksIEEE Transactions on Parallel and Distributed Systems, 1997
- On the diameter vulnerability of Kautz digraphsDiscrete Mathematics, 1996
- Fault diameter of interconnection networksComputers & Mathematics with Applications, 1987