
تعداد نشریات | 162 |
تعداد شمارهها | 6,669 |
تعداد مقالات | 71,916 |
تعداد مشاهده مقاله | 128,650,315 |
تعداد دریافت فایل اصل مقاله | 101,482,609 |
3-difference cordial labeling of some cycle related graphs | ||
Journal of Algorithms and Computation | ||
مقاله 1، دوره 47، شماره 1، شهریور 2016، صفحه 1-10 اصل مقاله (691.09 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2016.7927 | ||
نویسندگان | ||
R. Ponraj* 1؛ M. Maria Adaickalam2 | ||
1Department of Mathematics, Sri Paramakalyani College,Alwarkurichi-627 412, India | ||
2Department of Mathematics, Kamarajar Government Arts College, Surandai-627859, India | ||
چکیده | ||
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate the 3-difference cordial labeling of wheel, helms, flower graph, sunflower graph, lotus inside a circle, closed helm, and double wheel. | ||
کلیدواژهها | ||
Path؛ cycle؛ Wheel؛ Star | ||
آمار تعداد مشاهده مقاله: 1,521 تعداد دریافت فایل اصل مقاله: 1,134 |