Note on edge irregular reflexive labelings of graphs

Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

18 Citas (Scopus)

Resumen

For a graph G, an edge labeling fe:E(G)→{1,2,…,ke} and a vertex labeling fv:V(G)→{0,2,4,…,2kv} are called total k-labeling, where k=max{ke,2kv}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two different edges xy and xy of G, one has wt(xy)=fv(x)+fe(xy)+fv(y)≠wt(xy)=fv(x)+fe(xy)+fv(y).The minimum k for which the graph G has an edge irregular reflexive k-labeling is called the reflexive edge strength of G. In this paper we determine the exact value of the reflexive edge strength for cycles, Cartesian product of two cycles and for join graphs of the path and cycle with 2K2.

Idioma originalInglés
Páginas (desde-hasta)145-157
Número de páginas13
PublicaciónAKCE International Journal of Graphs and Combinatorics
Volumen16
N.º2
DOI
EstadoPublicada - ago. 2019
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Note on edge irregular reflexive labelings of graphs'. En conjunto forman una huella única.

Citar esto