/manager/Index ${session.getAttribute("locale")} 5 Note on edge irregular reflexive labelings of graphs /manager/Repository/uon:44976 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 x′ y′ of G, one has wt(xy) = fv(x) + fe(xy) + fv(y) ̸= wt(x′ y′) = fv(x′) + fe(x′ y′) + 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.]]> Wed 26 Oct 2022 08:53:34 AEDT ]]> On edge irregular reflexive labellings for the generalized friendship graphs /manager/Repository/uon:31129 Tue 04 Feb 2020 10:56:06 AEDT ]]> Wavelet characterization of eucalypt flowering and the influence of climate /manager/Repository/uon:12316 Sat 24 Mar 2018 08:11:35 AEDT ]]>