تعداد نشریات | 161 |
تعداد شمارهها | 6,573 |
تعداد مقالات | 71,037 |
تعداد مشاهده مقاله | 125,520,718 |
تعداد دریافت فایل اصل مقاله | 98,780,216 |
PD-prime cordial labeling of graphs | ||
Journal of Algorithms and Computation | ||
مقاله 1، دوره 51، شماره 2، اسفند 2019، صفحه 1-7 اصل مقاله (109.24 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2019.75109 | ||
نویسندگان | ||
R Ponraj* 1؛ S SUBBULAKSHMI* 2؛ S Somasundaram* 3 | ||
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India | ||
2Research Scholar, Department of Mathematics Sri Paramakalyani College, Alwarkurichi-627412, Tamilnadu, India | ||
3Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India | ||
چکیده | ||
\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_{uv}, d_{uv})=1$ or $0$ otherwise. $f$ is called PD-prime cordial labeling if $\left|e_{f}\left(0\right)-e_{f}\left(1\right) \right| \leq 1$ where $e_{f}\left(0\right)$ and $e_{f}\left(1\right)$ respectively denote the number of edges labelled with $0$ and $1$. A graph with admit a PD-prime cordial labeling is called PD-prime cordial graph. & & \vspace{0.2cm} | ||
کلیدواژهها | ||
Path؛ bistar؛ subdivison of star؛ subdivison of bistar؛ wheel؛ Fan؛ double fan | ||
آمار تعداد مشاهده مقاله: 299 تعداد دریافت فایل اصل مقاله: 471 |