|
Let G be a connected graph whose vertices n ≥ 4, the minimum degree δ, radius r, then there δr ≤ (?), With equality if and only if the following ( 1 ) , ( 2 ) , ( 3 ) established by one of three type : (1) G is the K5, (2) G ~ = K5 \\ M, where M is a perfect match , and when n is an even number , (3) δ = n - 3, △ ≤ n - 2, when n is odd . solve this conclusion graph edge connectivity and radius of the product related to a conjecture by Sedlar, Vukicevi'c, Aouchice and Hansen [14] proposed addition , the use of the structure of FIG diameter greatly , the number of vertices in the graph and the diameter of the given circumstances, we find the minimum maximum average distance map , so as to solve the Aouchiche and Hansen [17] proposed a conjecture .
|