Computing graph energy: An alternative approach
The characteristic polynomial corresponding to the adjacency matrix of a graph is obtained by the Faddeev-Leverrier algorithm. Subsequently, an improved numerical scheme, based on the Newton-Raphson algorithm and the Adomian decomposition method, is applied to calculate the energy of the graph (the...
Main Authors: | Fatoorehchi Hooman, Gutman Ivan, Abolghasemi Hossein |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Kragujevac, Faculty of Science
2014-01-01
|
Series: | Kragujevac Journal of Science |
Online Access: | http://scindeks-clanci.ceon.rs/data/pdf/1450-9636/2014/1450-96361436069F.pdf |
Similar Items
-
On Calculation of Adomian Polynomials by MATLAB
by: Hossein ABOLGHASEMI, et al.
Published: (2011-01-01) -
On the Solution of the Tao-Mason Equation of State by a Nonlinear Ordinary Differential Equation
by: Hooman Fatoorehchi
Published: (2022-12-01) -
Oboudi-Type Bounds for Graph Energy
by: Ivan Gutman
Published: (2019-12-01) -
Survey of Graph Energies
by: Ivan Gutman, et al.
Published: (2017-12-01) -
Seidel Signless Laplacian Energy of Graphs
by: Harishchandra Ramane, et al.
Published: (2017-12-01)