Abstract
In graph theory and study of fault tolerance and transmission delay of networks, connectivity and diameter of a graph are two very important parameters and have been deeply studied by many authors. Wide diameter combining connectivity with diameter is a more important parameter to measure fault tolerance and efficiency of parallel processing computer networks and has received much attention in the recent years. Diameter with width k of a graph G is defined as the minimum integer d for which between any two distinct vertices in G there exist at least k internally disjoint paths of length at most d. In the present paper, the tight upper bounds of wide diameter of the Cartesian product graphs are obtained. Some known results can be deduced or improved from ours.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
