Rajendra, P. and Rangarajan, R. (2015) Minimum covering color energy of a graph. International Journal of Mathematical Sciences and Engineering Applications, 9 (I). pp. 129-141.
Full text not available from this repository. (Request a copy)Abstract
In the current literature, two interesting and innovative energy concepts of a graph, namely, the concept of minimum covering energy of a graph and the concept of color energy of a graph are introduced by C. Adiga et. al. (1, 2). Motivated from these two research papers, we are defining a new concept called minimum covering color energy of a graph. In this paper, we establish results on energy, bounds and determinants of minimum covering color matrix of some graphs.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Minimum Covering Set and Color Energy and Minimum Covering Color Energy |
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | Users 19 not found. |
| Date Deposited: | 10 Jul 2019 05:18 |
| Last Modified: | 10 Jul 2019 05:18 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/5030 |
Actions (login required)
 |
View Item |
