Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China
Abstract:
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.