
تعداد نشریات | 162 |
تعداد شمارهها | 6,622 |
تعداد مقالات | 71,533 |
تعداد مشاهده مقاله | 126,862,239 |
تعداد دریافت فایل اصل مقاله | 99,905,051 |
$4$-Total prime cordial labeling of some cycle related graphs | ||
Journal of Algorithms and Computation | ||
مقاله 4، دوره 50، issue 2، اسفند 2018، صفحه 49-57 اصل مقاله (251.94 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2018.69777 | ||
نویسندگان | ||
R Ponraj* 1؛ J Maruthamani2 | ||
1Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India | ||
2Research Scholar, Register number: 18124012091054, Department of Mathematics, Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India | ||
چکیده | ||
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 cordial labeling is called $k$-total prime cordial graph. In this paper we investigate the $4$-total prime cordial labeling of some graphs like Prism, Helm, Dumbbell graph, Sun flower graph. | ||
کلیدواژهها | ||
Prism؛ Helm؛ Dumbbell graph؛ Sun flower graph | ||
آمار تعداد مشاهده مقاله: 302 تعداد دریافت فایل اصل مقاله: 236 |