|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 171 - Issue 1 |
| Published: Aug 2017 |
| Authors: P. Rajendra |
10.5120/ijca2017914955
|
P. Rajendra . Randic Color Energy of a Graph. International Journal of Computer Applications. 171, 1 (Aug 2017), 1-5. DOI=10.5120/ijca2017914955
@article{ 10.5120/ijca2017914955,
author = { P. Rajendra },
title = { Randic Color Energy of a Graph },
journal = { International Journal of Computer Applications },
year = { 2017 },
volume = { 171 },
number = { 1 },
pages = { 1-5 },
doi = { 10.5120/ijca2017914955 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2017
%A P. Rajendra
%T Randic Color Energy of a Graph%T
%J International Journal of Computer Applications
%V 171
%N 1
%P 1-5
%R 10.5120/ijca2017914955
%I Foundation of Computer Science (FCS), NY, USA
Let G = (V,E) be a colored graph with vertex set V(G) and edge set E(G) with chromatic number (G) and di is the degree of a vertex vi. The Randic matrix R(G) = (rij) of a graph G, is defined by rij = 1⁄√didj , if the vertices vi and vj are adjacent and rij = 0, otherwise. The Randic energy [5] RE(G) is the sum of absolute values of the eigenvalues of R(G). The concept of Randic color energy ERC(G) of a colored graph G is defined and obtained the Randic color energy ERC(G) of some graphs with minimum number of colors.