Some new results on energy of graphs

Vaidya, Samir K.; Popat, Kalpesh M.

dc.contributor.author	Vaidya, Samir K.
dc.contributor.author	Popat, Kalpesh M.
dc.date.accessioned	2023-05-01T04:20:51Z
dc.date.available	2023-05-01T04:20:51Z
dc.date.issued	2017
dc.identifier.citation	Vaidya, S. K., & Popat, K. M. (2017). Some new results on energy of graphs. MATCH Commun. Math. Comput. Chem, 77, 589-594.	en_US
dc.identifier.issn	0340-6253
dc.identifier.uri	http://10.9.150.37:8080/dspace//handle/atmiyauni/815
dc.description.abstract	The eigenvalue of a graph G is the eigenvalue of its adjacency matrix. The energy E (G) of G is the sum of absolute values of its eigenvalues. A natural question arises: How the energy of a given graph G can be related with the graph obtained from G by means of some graph operations? In order to answer this question, we have considered two graphs namely, splitting graph S′(G) and shadow graph D2 (G). It has been proven that E (S′(G))=√ 5 E (G) and E (D2 (G))= 2E (G).	en_US
dc.language.iso	en	en_US
dc.publisher	MATCH Communications in Mathematical and in Computer Chemistry	en_US
dc.title	Some new results on energy of graphs	en_US
dc.type	Article	en_US