Codi QR

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...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autors principals: Chirag Barasara, Palak Prajapati
Format: Artigo
Idioma:Inglês
Publicat: Accademia Piceno Aprutina dei Velati 2023-12-01
Col·lecció:Ratio Mathematica
Matèries:
Accés en línia:http://eiris.it/ojs/index.php/ratiomathematica/article/view/1253
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!