Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a function. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if ∣∣vf (i)− vf (j)∣∣ 6 1, i, j ∈ {1, 2, . . . , k} and ∣∣ef (0)− ef (1)∣∣ 6 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled ...

Let G be a graph with vertex set V(G) and edge set E(G), and let A be an abelian group. A labeling f : V(G) ....... A induces a edge labeling r : E{G) ....... A defined by r(xy) = f(x) + f(y) for each xy E E. For each i E A, let vJ(i) card{v E V(G) : f(v) i} and eJ(i) card{e E E(G) : r(e) i}. Let c(J) {leJ(i) eJ(j)1 : = = (i,j) E A x A}. A labeling f of a graph G is said to be A-friendly if IVJ...

Let G be a (p, q) graph. Let f : V (G) → {1, 2 . . . , p} be a function. For each edge uv, assign the label |f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and |ef (0)− ef (1)| ≤ 1 where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial grap...

A morpho-syntactic tagger associates to each word of a corpus a label which recapitulates its morpho-syntatic properties in the text. In corpora from oral data, not only do we have to face the usual problem of multi-labels words, but also the more specific problems of disfluences (repetitions, ungrammatical constructions...), of non existing words and of the lack of punctuation marks [1]. First...

a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and other standard graphs were studied. Also four prime cordial labeling behavior of complete graph, book, flower were studied. In this paper, we investigate the four prime cordial labeling behavior of corona of wh...

Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...

This paper reports on the syntactic annotation of a previously compiled and tagged corpus of European Portuguese (EP) dialects – The Syntax-oriented Corpus of Portuguese Dialects (CORDIAL-SIN). The parsed version of CORDIAL-SIN is intended to be a more efficient resource for the purpose of studying dialect syntax by allowing automated searches for various syntactic constructions of interest. To...

let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the s...

Abstract A binary vertex labeling f : V (G) → Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f∗ : E(G) → Z2 defined by f∗(uv) = f(u)f(v) for all uv ∈ E(G). Let ef (i) = {uv ∈ E(G) : f∗(uv) = i} be the number of edges of G that are labeled i. Productcordial index of...