let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...

Recently, the researchers have proposed a number of labeling schemes. In these labeling schemes, the approach which can extract structural information between nodes and process query efficiently is more outstanding. However, most of these labeling schemes do not well support update operations. To achieve update-friendly operations, some of the methods keep intervals between labeling numbers, bu...

In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recently. However, a harmonic support of efficient query processing and updating has not been achieved. In this paper, we propose an efficient XML encoding and labeling scheme, called EXEL, which is a variant of the region n...

a graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ e(g)} consists of n integers. inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of g and k2 , and the disjoint :union: of g...

Menu labeling is an attempt to educate consumers about the nutrition value of the foods. The importance of using menu labeling has been highlighted in many studies in the past. Although public health programs are educating public on obesity but still this phenomenon is a serious problem in Malaysia. This study identified factors that influence intention to use menu labeling among fast food cons...

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

We provide a new characterization of L evy's redex-families in the-calculus 12] as suitable paths in the initial term of the derivation. The idea is that redexes in a same family are created by \contraction" (via-reduction) of a unique common path in the initial term. This fact gives new evidence about the \common nature" of redexes in a same family, and about the possibility of sharing their r...