Graph Theory With Applications
Graph Theory With Applications
Vulnerability in graphs of diameter four
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.98 |
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 results given by Hartman and Rubin in [1] and a theorem obtained in [6] are extended.