Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/815
Title: Some new results on energy of graphs
Authors: Vaidya, Samir K.
Popat, Kalpesh M.
Issue Date: 2017
Publisher: MATCH Communications in Mathematical and in Computer Chemistry
Citation: Vaidya, S. K., & Popat, K. M. (2017). Some new results on energy of graphs. MATCH Commun. Math. Comput. Chem, 77, 589-594.
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).
URI: http://10.9.150.37:8080/dspace//handle/atmiyauni/815
ISSN: 0340-6253
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
294) 13100_Kalpesh Mansukhlal Popat.pdf600.89 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.