Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1116
Title: | THE MINIMUM COVERING DISTANCE AND MINIMUM COVERING HARARY ENERGY OF FRIENDSHIP GRAPH |
Authors: | S, Sreeja U, Mary |
Keywords: | Energy Minimum Covering Energy Eigen values Minimum covering Distance energy Minimum covering Harary energy Friendship Graph |
Issue Date: | Nov-2019 |
Publisher: | Journal of Information and Computational Science |
Abstract: | The 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. |
URI: | DOI:10.123.JICS.2019.V9I11.535569.11161 http://localhost:8080/xmlui/handle/123456789/1116 |
ISSN: | 1548-7741 |
Appears in Collections: | International Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
THE MINIMUM COVERING DISTANCE AND MINIMUM COVERING HARARY ENERGY OF FRIENDSHIP GRAPH.docx | 10.02 kB | Microsoft Word XML | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.