Square Difference Prime Labeling for Duplication of Graphs
نویسندگان
چکیده
Let G(V, E) be a graph with pvertices and qedges. f∶ V (G) → {0,1,2,…, p-1} bijection such that the induced function f*: E(G) N defined by f_sqdp* (uv)=|[f(u) ]2-[f(v) ]2 | for everyuv∈E(G).If is injective, then f_sqdp*is calledsquare difference labeling of G.A Gwhich admits square called graph. The greatest common incidence number (gcin) vertex v degree > 1 as divisor (g.c.d) labels incident edges on v. A fis said to prime if each >1 gcin(v) = 1. In this paper we investigate labelling Petal duplication petal
منابع مشابه
PD-prime cordial labeling of graphs
vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and\ $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq f(v)\ \ left[frac{f(v)}{f(u)}right] ~~if~~ f(v) geq f(u)\ end{cases} $\ for all edge $uv in E(G)$. For each edge $uv$ assign the label $1$ if $gcd (p_{u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of engineering and advanced technology
سال: 2022
ISSN: ['2249-8958']
DOI: https://doi.org/10.35940/ijeat.b3867.1212222