( 2 ) in this paper , we study the generalized fc - diameter of / c - regular k - connected graphs
We derive some properties of gdk ( g ) and show that every fc - regular / c - connected graph on n vertices has generalized fc - diameter at most n / 2 and this upper bound is tight when n = 2k ? 3 + i ( k ? 2 )
In this paper , we study the rabin number of k - regular ^ - connected graphs and prove that every fe - regular / - connected graph on n vertices has rabin number at most n / 2 and this upper bound cannot be improved when n = 2k - 3 + i ( k - 2 )
手机版