Abstract
An edge-cut X of G is essential if G−X has at least two non-trivial components, the essential edge-connectivity of G is the minimum cardinality over all essential edge-cuts of G. In this paper, we determine the graphs attaining the maximum spectral radius among all graphs with minimum degree and essential edge-connectivity. Moreover, the extremal graphs are characterized. This generalizes some previous results on edge-connectivity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
