| Autor: |
J., Jeba Jesintha, N. K., Vinodhini, S., Benazir Fathima |
| Předmět: |
|
| Zdroj: |
Bulletin of Pure & Applied Sciences-Mathematics; Jul-Dec2022, Vol. 41E Issue 2, p156-158, 3p |
| Abstrakt: |
A graph with q edges is called antimagic if its edges can be labeled with 1,2,...,q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. A graph which admits an antimagic labeling is called an antimagic graph. In this paper, we prove that the Pumpkin graph admit antimagic labeling. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
