Note on edge irregular reflexive labelings of graphs
2018; Elsevier BV; Volume: 16; Issue: 2 Linguagem: Inglês
10.1016/j.akcej.2018.01.013
ISSN2543-3474
AutoresMartin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová–Feňovčíková, Dushyant Tanna,
Tópico(s)graph theory and CDMA systems
ResumoFor a graph , an edge labeling and a vertex labeling are called total -labeling, where . The total -labeling is called an edge irregular reflexive -labeling of the graph , if for every two different edges and of , one has The minimum for which the graph has an edge irregular reflexive -labeling is called the reflexive edge strength of .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 .
Referência(s)