| تعداد نشریات | 6 |
| تعداد شمارهها | 122 |
| تعداد مقالات | 1,555 |
| تعداد مشاهده مقاله | 1,657,197 |
| تعداد دریافت فایل اصل مقاله | 1,547,528 |
Some Results on Local Distance Antimagic Chromatic Number of Graphs* | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 05 تیر 1405 | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2026.31314.2818 | ||
| نویسندگان | ||
| Maurice Genevieva Almeida* 1؛ Tarkeshwar Singh2 | ||
| 1Ph. D. Scholar, Birla Institute of Technology and Sciences, Goa Campus, Goa | ||
| 2Department of Mathematics, Birla Institute of Technology and Sciences, K K Birla Goa Campus, Goa, India | ||
| چکیده | ||
| Let G = (V,E) be a simple graph of order n without isolated vertices. A bijection f : V →{1,2,...,n} is called a local distance antimagic labeling if w(u) is not equal to w(v) for every edge uv of G, where w(u) is the sum of the labels of neighbors of vertex u. The local distance antimagic chromatic number of a graph χld(G) is defined as the minimum number of colors taken over all the colorings of G induced by local distance antimagic labeling of G. In this paper, we study the local distance antimagic chromatic number for the join of graphs and the lexicographic product of graphs with the complement of the complete graph. | ||
| کلیدواژهها | ||
| Local distance antimagic labeling؛ local distance antimagic chromatic number؛ lexicographic product | ||
|
آمار تعداد مشاهده مقاله: 1 |
||