QR kód

Antimagic Labeling of Some Degree Splitting Graphs

A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct.  As Wang et al. [2012], proved that not all graphs are antimagic, it is interesting to investigate antimagi...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Chirag Barasara, Palak Prajapati
Médium: Artigo
Jazyk:Inglês
Vydáno: Accademia Piceno Aprutina dei Velati 2023-12-01
Edice:Ratio Mathematica
Témata:
On-line přístup:http://eiris.it/ojs/index.php/ratiomathematica/article/view/1253
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!