نتایج جستجو برای: cordial index
تعداد نتایج: 396522 فیلتر نتایج به سال:
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...
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 quasiexperiment...
We present here prime cordial labeling for the graphs obtained by some graph operations on cycle related graphs.
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. 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)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 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 with 1....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید