A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs explain necessary sufficient conditions for construction cordial.

BACKGROUND Intake of sweet drinks has previously been associated with the development of overweight and obesity among children and adolescents. The present study aimed to assess the consumption pattern of sweet drinks in a population of children and adolescents in Victoria, Australia. METHODS Data on 1,604 children and adolescents (4-18 years) from the comparison groups of two quasi-experimen...

pin-pointing some opportunities for development. That developments would be welcome to paediatricians is clear from Dr. Apley's article; and the relationship between these two branches of medicine is generally clear and cordial. But there are many other professional people who are involved in the welfare of mentally and physically sick children, but whose relationship to the Child Guidance Clin...

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...

This papers deals with the Edge cordial labeling of newly introduced eight sprocket graph. graph is already proven as and gracious in labelling. In our study we have further proved that Eight Sprocket related families connected edge-cordial graphs. Also path union graph, cycle star are Edge-cordial.Â

Hovey introduced $A$-cordial labelings as a generalization of cordial and harmonious \cite{Hovey}. If $A$ is an Abelian group, then labeling $f \colon V (G) \rightarrow A$ the vertices some graph $G$ induces edge on $G$; $uv$ receives label (u) + f (v)$. A if there vertex-labeling such that (1) vertex classes differ in size by at most one (2) induced one. Patrias Pechenik studied larger class f...

Let an injective function f from vertex set V of a graph G to the (F0, F1, F2, ..., Fn), where Fj is jth Fibonacci number (j=0, 1, n), said be cordial labeling if induced f* edge E {0,1} defined by (uv) = (f(u)+f(v)) (mod2) satisfies condition |ef(0)- ef(1) ≤ ef(0) edges with label 0 and 1. A which admits called graph.