A STUDY ON ENERGY OF HELM, CLOSED HELM, FLOWER AND BISTAR GRAPH USING MATLAB PROGRAM

R. Arundhadhi, B. Megala

Abstract


The energy E(G), of a simple graph G is the sum of the absolute values of the eigenvalues of its adjaceny matrix A(G). In this paper we have discussed the energy of Helm, Closed helm, Flower and Bistar graph for any values of n using MATLAB program.


Keywords


Energy of graph, Helm graph, Flower graph, Bistar graph.

Full Text:

PDF

References


Balakrishnan R, (2004), The energy of a graph, Linear Algebra APPL.,387, 287-295.

Douglas B.West, (2003),Introduction to Graph Theory, Second Edition.

Ivan Gutman, (1978), The energy of a graph, 10. Steiermarkisches Mathematises Symposium(Stift rain, Graz, 1978), 103, 1-22.

Ivan Gutam & B.Zhou, (2006),Laplacian Energy of a graph, Lin.Algebra Appl., 414, 29-37.

Kinkar Ch.Das, & Mojallal S.A,(2013), Upper Bounds for the Energy of Graphs, Match commun Math. Comput. Chem., 70, 657-662.

Sophia Shalini G.B, & Mayamma Joseph,(2017), New results on energy of Graphs of small order, Global Journal of pure and Applied Mathematics, 13, 2837-2848.

Yu A, Lu M, & Tian F,(2005), New upper bound for the energy of graphs, MATCH. Commun. Math. Comput. Chem., 53,441-448.


Refbacks

  • There are currently no refbacks.