On Color Energy of Few Classes of Bipartite Graphs and Corresponding Color Complements

Please use this identifier to cite or link to this item: http://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/442

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bharat Joshi, Prajakta	-
dc.contributor.author	Joseph, Mayamma	-
dc.date.accessioned	2022-05-11T07:09:59Z	-
dc.date.available	2022-05-11T07:09:59Z	-
dc.date.issued	2019-09	-
dc.identifier.issn	2278-9561	-
dc.identifier.issn	2278-957X	-
dc.identifier.uri	http://dspace.chitkarauniversity.edu.in/xmlui/handle/123456789/442	-
dc.description.abstract	For a given colored graph G, the color energy is defined as Ec(G) = Σλi, for i = 1, 2,…., n; where λi is a color eigenvalue of the color matrix of G, Ac (G) with entries as 1, if both the corresponding vertices are neighbors and have different colors; -1, if both the corresponding vertices are not neighbors and have same colors and 0, otherwise. In this article, we study color energy of graphs with proper coloring and L (h, k)-coloring. Further, we examine the relation between Ec(G) with the corresponding color complement of a given graph G and other graph parameters such as chromatic number and domination number. AMS Subject Classification: 05C15, 05C50	en_US
dc.language.iso	en	en_US
dc.relation.ispartofseries	;CHAENG/2013/49583	-
dc.subject	Color eigenvalues	en_US
dc.subject	color complement	en_US
dc.subject	color energy	en_US
dc.title	On Color Energy of Few Classes of Bipartite Graphs and Corresponding Color Complements	en_US
dc.type	Article	en_US
Appears in Collections:	Vol. 8 No. 1 (2019)

Files in This Item:

File	Description	Size	Format
209-Article Text-462-3-10-20200317.pdf		384.64 kB	Adobe PDF	View/Open