Color Energy Of A Unitary Cayley Graph
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In thi...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
University of Zielona Góra
2014-11-01
|
| Rangatū: | Discussiones Mathematicae Graph Theory |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.7151/dmgt.1767 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|