ON LAPLACIAN LIKE ENERGY OF TREES
By Aleksandar Ilić, D. Krtinic, Milovan Ilic. 2011
48 citations recorded by the source corpus.
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matrix L(G), det(λI − L(G)) = � n=0(−1) k ckλ n−k . Laplacian–like energy of a graph is newly proposed graph invariant, defined as the sum of square roots of Laplacian eigenvalues. For bipartite graphs, the Laplacian–like energy coincides with the recently defined incidence energy IE(G) of a graph. In [D. �
Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry
View Paper: https://www.semanticscholar.org/paper/defdf7bb3c54c525438a1a916e44145e7dbf5710
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
- Aleksandar Ilić
- Ivan Gutman
- Dragan Stevanovic
- A. c
- Bo Zhou
- Boris Furtula
- Zoran Stanic
- Ernesto Estrada
In Organic Chemistry
- Aleksandar Ilić
- Dragan Stevanovic
- Ivan Gutman
- Bo Zhou
- Boris Furtula
- Ernesto Estrada
- A. Güngör
- Gopalapillai Indulal
Citations in the corpus
- Eccentric Connectivity Index of Chemical Trees (2011, background): “Further, within the same class of trees, the broom has minimum Wiener index and Laplacian-energy like invariant [16].”
- Distance spectral radius of trees with fixed maximum degree (2010, background): “Further, within the same class of trees, the broom has the minimum Wiener index and Laplacianenergy like invariant [21].”
- Linear Algebra and its Applications (2010, background): “We there-forefocusoniterationwherebywerewrite(Schurcomplement)thelinearsystem(3.7)toanequivalent formwhichissignificantlymoreamenableforiterativesolution.”