$k$-Total prime cordial labeling of graphs

	$k$-Total prime cordial labeling of graphs
Journal of Algorithms and Computation
مقاله 9، دوره 50، شماره 1، شهریور 2018، صفحه 143-149 اصل مقاله (242.45 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2018.68651
نویسندگان
R Ponraj^* ¹؛ J Maruthamani²؛ R Kala³
¹Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627412
²Research Scholar, Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627 012, Tamilnadu, India.
³Department of Mathematics, Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627 012, Tamilnadu, India.
چکیده
In this paper we introduce a new graph labeling method called $k$-Total prime cordial. 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, \ldots, k\}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labeled with $x$. We investigate k-total prime cordial labeling of some graphs and study the 4-total prime cordial labeling of path, cycle, complete graph etc.
کلیدواژه‌ها
Path؛ cycle؛ complete graph؛ Star؛ Bistar

آمار تعداد مشاهده مقاله: 487 تعداد دریافت فایل اصل مقاله: 528

سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب