On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion
All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of vertex is the sum of its incident edges label. T...
Furkejuvvon:
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2021-11-01
|
| Ráidu: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Fáttát: | |
| Liŋkkat: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/12796 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|