The W-Wide Diameter of Two Graph

The diameter and W-wide diameter of a graph measure delay time in a collateral and distribute net, in this paper, two kinds of W-wide diameter are studied.The first, the minimum number of 2-wide diameter of c(n,t) is studied, where graph c(n,t) is formed by adding t edges beyond a given n-cycal Cn, An upped and down bounds of h(n,t) are obtained. Fathermore, the guess accuracy number of h(n,t) is offerd At the same time, based on the analysis of the connectivity of the join graph,an upped bound of W-wide diameter of join graph is also obtained.