Abstract
A 2-edge-connected graph G is minimally 2-edge-connected if deleting arbitrary edge of G always leaves a graph which is not 2-edge-connected. In this paper, we completely characterize the (minimally) 2-edge-connected graphs with given size having the maximal signless Laplacian (Laplacian) index.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have