Adiga, Chandrashekar and Sampathkumar, E. and Sriraj, M. A. and Shrikanth, A. S. (2013) Color energy of a graph. Proceedings of the Jangjeon Mathematical Society, 16 (3). pp. 335-351.
Full text not available from this repository. (Request a copy)
Official URL: http://www.jangjeon.or.kr/etc/Search.html?division...
Abstract
In this paper, we introduce the concept of color energy of a graph, E C(G) and compute the color energy EX(G) of few families of graphs with minimum number of colors. It depends on the underlying graph and colors on its vertices. We establish an upper bound and a lower bound for color energy. Also we introduce the concept of complement of a colored graph and compute energies of complement of colored graphs of few families of graphs.
| Item Type: | Article |
|---|---|
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | Arshiya Kousar Library Assistant |
| Date Deposited: | 11 Sep 2019 05:47 |
| Last Modified: | 21 Dec 2020 05:21 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/7824 |
Actions (login required)
 |
View Item |
