1. Collections at PSGRKCW
  2. E -KCW-Department Publications
  3. Department of Mathematics
  4. International Journals
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1116
Full metadata record
DC FieldValueLanguage
dc.contributor.authorS, Sreeja-
dc.contributor.authorU, Mary-
dc.date.accessioned2020-08-25T07:31:56Z-
dc.date.available2020-08-25T07:31:56Z-
dc.date.issued2019-11-
dc.identifier.issn1548-7741-
dc.identifier.uriDOI:10.123.JICS.2019.V9I11.535569.11161-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1116-
dc.description.abstractThe Minimum covering energy of a graph depends upon the minimum covering set of the particular graph [1]. Motivated by this concept, we have studied the Minimum covering Distance energy and Minimum covering Harary energy introduced in [6] & [7] and we have extended these energies to the Friendship Graph.en_US
dc.language.isoenen_US
dc.publisherJournal of Information and Computational Scienceen_US
dc.subjectEnergyen_US
dc.subjectMinimum Covering Energyen_US
dc.subjectEigen valuesen_US
dc.subjectMinimum covering Distance energyen_US
dc.subjectMinimum covering Harary energyen_US
dc.subjectFriendship Graphen_US
dc.titleTHE MINIMUM COVERING DISTANCE AND MINIMUM COVERING HARARY ENERGY OF FRIENDSHIP GRAPHen_US
dc.typeArticleen_US
Appears in Collections:International Journals

Files in This Item:
File Description SizeFormat 
THE MINIMUM COVERING DISTANCE AND MINIMUM COVERING HARARY ENERGY OF FRIENDSHIP GRAPH.docx10.02 kBMicrosoft Word XMLView/Open
Show simple item record


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