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 an edge labeling f"': E(G) A defined by f"'(xy) = f(x) + fey), for each edge xy e E(G). For i e A, let vt<i) = card { v e V(G) : f(v) = i} and er(i) = card ( e e E(G) : f"'(e) = i}. Let c(f) = {Iet<i) etG)1 : (i, j) e A x A}. A labeling f of a graph G is said to be A­ friendly if...

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

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

A power cordial labeling of a graph G = V , E is bijection id="M2"> f : ⟶ open="{" close="}" 1,2 … open="|" close="|" such that an edge id="M3"> e u ...

Raspberry juice cordial has a long anecdotal use in Australia for the prophylaxis and treatment of gastroenteritis in livestock, cage birds and humans. The antimicrobial properties of raspberry juice cordial, raspberry juice, raspberry leaf extract and a commercial brand of raspberry leaf tea were investigated against five human pathogenic bacteria and two fungi. Raspberry cordial and juice wer...

We describe the visual model of Cordial, a visual language integrating Object-Oriented and Constraint programming. The motivation behind Cordial is to provide a clear notion of objects deened implicitly by means of constraints. Cordial is a visual language having three distinguished features: (1) A hierarchical visual model, (2) an underlined visual formalism giving precise syntax and static se...

In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.