On the Laplacian coefficients of unicyclic graphs

77 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

ON LAPLACIAN LIKE ENERGY OF TREES (2011, unknown): “If possible, send your correspondence via e-mail.”
A Unified Approach to Extremal Multiplicative Zagreb Indices for Trees, Unicyclic and Bicyclic Graphs ∗ (2012, background): “A unicyclic graph G is said to be a sun graph ([15]) if cycle vertices have degree at most three and remaining vertices have degree at most two.”
Trees, Unicyclic, and Bicyclic Graphs Extremal with Respect to Multiplicative Sum Zagreb Index ∗ (2012, background): “A unicyclic graph G is said to be a sun graph ([17]) if the vertices belonging to the cycle have degree at most three and the remaining vertices have degree at most two.”
On Laplacian-energy-like invariant of a graph < (2012, background): “Similarly, Stevanović and Ilić [19] gave the upper and lower bounds for LEL of unicycle graphs.”
Eccentric connectivity index (2011, background): “Ilić and Stevanović in [44] proved that among all connected unicyclic graphs Cn maximizes, while Hn,3 minimizes all Laplacian coefficients.”
The Laplacian-energy Like Invariant is an Energy Like Invariant (2010, background): “After the publication of the paper [30], a number of properties of LEL have been established [31–33].”