https://ogma.newcastle.edu.au/vital/access/ /manager/Index
${session.getAttribute("locale")}5Note on edge irregular reflexive labelings of graphs
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:44976
G, an edge labeling f_{e} : E(G) → {1, 2, . . . , k_{e}} and a vertex labeling f_{v} : V(G) → {0, 2, 4, . . . , 2k_{v}} are called total k-labeling, where k = max{k_{e}, 2k_{v}}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two different edges xy and x′ y′ of G, one has wt(xy) = f_{v}(x) + f_{e}(xy) + f_{v}(y) ̸= wt(x′ y′) = f_{v}(x′) + f_{e}(x′ y′) + f_{v}(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 2K_{2}.]]>Wed 26 Oct 2022 08:53:34 AEDT]]>On edge irregular reflexive labellings for the generalized friendship graphs
https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31129
Tue 04 Feb 2020 10:56:06 AEDT]]>