COLOR ENERGY, ENERGY OF COMPLEMENT AND MINIMUM COVERING COLOR ENERGY OF FRIENDSHIP                GRAPH

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1114

Title:	COLOR ENERGY, ENERGY OF COMPLEMENT AND MINIMUM COVERING COLOR ENERGY OF FRIENDSHIP GRAPH
Authors:	S, Sreeja B, Tamilselvi
Keywords:	Color eigenvalues color energy of a graph complement of the colored graph energy of the complement of colored graph Minimum covering set Minimum covering color matrix Minimum covering color eigenvalues Minimum covering color energy of a graph Friendship graph
Issue Date:	Jan-2018
Publisher:	International Journal of Computer & Mathematical Sciences
Abstract:	Color energy and Energy of Complement of colored graphs depends on the the underlying graph and colors on its vertices. Minimum covering color energy depends on the underlying graph, covering set and the colors used for coloring its vertices. The concept of color energy and energy of complement of colored graph of Star graph, Cocktail party graph, Complete bipartite graph, Crown graph and Complete graph are determined in [ 3]. The concept of minimum covering color energy of Star graph, Cocktail party graph, Complete bipartite graph, Crown graph and Complete graph are discussed in [4]. In this paper we applied the concept of the Color energy, Energy of complement of colored graph and Minimum covering color energy to Friendship graph
URI:	https://academicscience.co.in/issue.php?id=15&journal=IJCMS&sid=72 http://localhost:8080/xmlui/handle/123456789/1114
ISSN:	2347-8527
Appears in Collections:	International Journals

Files in This Item:

File	Description	Size	Format
COLOR ENERGY, ENERGY OF COMPLEMENT AND MINIMUM COVERING COLOR ENERGY OF FRIENDSHIP GRAPH.docx		10.12 kB	Microsoft Word XML	View/Open