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.展开更多
基金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.
