‎a $(p‎,‎q)$ graph $g$ is said to have a $k$-odd mean‎ ‎labeling $(k ge 1)$ if there exists an injection $f‎ : ‎v‎ ‎to {0‎, ‎1‎, ‎2‎, ‎ldots‎, ‎2k‎ + ‎2q‎ - ‎3}$ such that the‎ ‎induced map $f^*$ defined on $e$ by $f^*(uv) =‎ ‎leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a‎ ‎bijection from $e$ to ${2k - ‎‎‎1‎, ‎2k‎ + ‎1‎, ‎2k‎ + ‎3‎, ‎ldots‎, ‎2‎ ‎k‎ + ‎2q‎ - ‎3}$‎. ‎a graph that admits $k$...

A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even-odd rule and the winding number, the former leading to ray-crossing, the latter to angle summation algorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algor...

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...

A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even–odd rule and the winding number, the former leading to ray-crossing, the latter to angle summation algorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algor...

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} de...

Based on the charge independence hypothesis the properties of V particles are theoretically investigated. It is found that the curious behaviours of these unstable particles are most simply interpreted in terms of the 1}-charge conservation law which directly results from the C. I. hypothesis and suitable isotopic spin assignments to these particles. The topics which are discussed in this paper...

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} defined 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 labelin...