In this paper we give a necessary and sufficient condition for a graph G with diameter 4 to be 3-diameter-stable.This result extended some known results.
A graph G is said to be an （l,d）-graph （with respect to edges） if d（G-E）≤d,E E（G） such that ｜ E ｜≤l-1.The l-diameter-stable graphs are （l,d）-graphs with diameter d.In this paper some new results on diame...A graph G is said to be an （l,d）-graph （with respect to edges） if d（G-E）≤d,E E（G） such that ｜ E ｜≤l-1.The l-diameter-stable graphs are （l,d）-graphs with diameter d.In this paper some new results on diameter-stable graphs are obtained.展开更多
The line persistence of a graph G, Pt （ G ） is the minimum number of lines which must be removed to increase the diameter of G. In Ref. [7] （J. Shanghai Univ., 2003,7（4）：352-357）, we gave a characterization of ...The line persistence of a graph G, Pt （ G ） is the minimum number of lines which must be removed to increase the diameter of G. In Ref. [7] （J. Shanghai Univ., 2003,7（4）：352-357）, we gave a characterization of graphs of diameter five with ρ1 （ G ）≥2. In this paper we will show that each of the 8 special graphs Xi （ i = 1,2,3,4,5,6,7,8） listed in condition （2） of Theorem 1 in Ref. [7] can not be deleted. Therefore the results we obtained in Ref. [7] can not in general be improved.展开更多
The line persistence of a graph G, ρ 1 (G) is the minimum number of lines which must be removed to increase the diameter of G. In this paper we give a characterization of graphs of diameter five with ρ 1(G)≥2.
基金supported by the Shanghai Leading Academic Discipline Project (Grant No.J50101)
文摘In this paper we give a necessary and sufficient condition for a graph G with diameter 4 to be 3-diameter-stable.This result extended some known results.
基金Project supported by the Shanghai Leading Academic Discipline Project (Grant No. J50101)
文摘A graph G is said to be an （l,d）-graph （with respect to edges） if d（G-E）≤d,E E（G） such that ｜ E ｜≤l-1.The l-diameter-stable graphs are （l,d）-graphs with diameter d.In this paper some new results on diameter-stable graphs are obtained.
基金Project supported by the Special Funds for Major Specialities of Shanghai Municipal Commission of Education
文摘The line persistence of a graph G, Pt （ G ） is the minimum number of lines which must be removed to increase the diameter of G. In Ref. [7] （J. Shanghai Univ., 2003,7（4）：352-357）, we gave a characterization of graphs of diameter five with ρ1 （ G ）≥2. In this paper we will show that each of the 8 special graphs Xi （ i = 1,2,3,4,5,6,7,8） listed in condition （2） of Theorem 1 in Ref. [7] can not be deleted. Therefore the results we obtained in Ref. [7] can not in general be improved.
文摘The line persistence of a graph G, ρ 1 (G) is the minimum number of lines which must be removed to increase the diameter of G. In this paper we give a characterization of graphs of diameter five with ρ 1(G)≥2.
