Please use this identifier to cite or link to this item: http://10.9.150.37:8080/dspace//handle/atmiyauni/2192
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPopat, Kalpesh-
dc.contributor.authorShingala, Kunal-
dc.date.accessioned2025-01-01T10:54:14Z-
dc.date.available2025-01-01T10:54:14Z-
dc.date.issued2023-
dc.identifier.issn1572-8897-
dc.identifier.urihttp://10.9.150.37:8080/dspace//handle/atmiyauni/2192-
dc.description.abstractThe graph Gσ is obtained from graph G by attaching self loops on σ vertices. The energy E(Gσ) of the graph Gσ with order n and eigenvalues λ1, λ2, . . . , λn is defined as E(Gσ) = Xn i=1 λi −σ/n.It has been proved that if σ = 0 or n then E(G) = E(Gσ).The obvious question arise: Are there any graph such that E(G) =E(Gσ) and 0< σ < n? We have found an affirmative answer of thisquestion and contributed a graph family which satisfies this property.en_US
dc.language.isoenen_US
dc.publisherJournal of Mathematical Chemistryen_US
dc.subjectEigenvalueen_US
dc.subjectEnergyen_US
dc.subjectSelf-loopsen_US
dc.titleSome New Results on Energy of Graphs with Self Loopsen_US
dc.typeArticleen_US
Appears in Collections:01. Journal Articles

Files in This Item:
File Description SizeFormat 
v1_covered_e0888953-5588-4d3b-9f1a-aa115a240148.pdf217.61 kBAdobe PDFView/Open
Show simple item record


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