Wide Diameters of Cartesian Product Graphs and Digraphs

Jun-Ming Xu
Additional contact information
Jun-Ming Xu: Universtiy of Science and Technology of China

Journal of Combinatorial Optimization, 2004, vol. 8, issue 2, No 6, 181 pages

Abstract: 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.

Keywords: connectivity; diameter; wide diameter; cartesian product; networks; fault tolerance (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000031418.45051.8b Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:2:d:10.1023_b:joco.0000031418.45051.8b

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000031418.45051.8b

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().