آمار
| تعداد نشریات | 5 |
| تعداد شماره‌ها | 111 |
| تعداد مقالات | 1,247 |
| تعداد مشاهده مقاله | 1,199,749 |
| تعداد دریافت فایل اصل مقاله | 1,060,508 |
Complete solutions on local antimagic chromatic number of three families of disconnected graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 26 اسفند 1402 اصل مقاله (499.37 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2024.29032.1818 | ||
| نویسندگان | ||
| Tsz Lung Chan1؛ Gee-Choon Lau* 2؛ W.C. Shiu3 | ||
| 1Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, P.R. China. | ||
| 2Universiti Teknologi MARA, College of Computing, Informatics & Mathematics, Johor, Malaysia | ||
| 3Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, P.R. China. | ||
| چکیده | ||
| An edge labeling of a graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f:E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we study local antimagic labeling of disjoint unions of stars, paths and cycles whose components need not be identical. Consequently, we completely determined the local antimagic chromatic numbers of disjoint union of 2 stars, paths, and 2-regular graphs with at most one odd order component respectively. | ||
| کلیدواژه‌ها | ||
| Local antimagic labeling؛ local antimagic chromatic number؛ disconnected graphs | ||
| مراجع | ||
|
[1] S. Arumugam, K. Premalatha, M. Bača, and A. Semaničová-Feňovčíková, Local antimagic vertex coloring of a graph, Graphs Combin. 33 (2017), no. 2, 275–285. https://doi.org/10.1007/s00373-017-1758-7 [2] M. Bača, A. Semaničová-Feňovčíková, and T.M. Wang, Local antimagic chromatic number for copies of graphs, Mathematics 9 (2021), no. 11, Article ID: 1230. https://doi.org/10.3390/math9111230 [3] J. Bensmail, M. Senhaji, and K.S. Lyngsie, On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture, Discrete Math. Theor. Comput. Sci. 19 (2017), no. 1, Article ID: #21 https://doi.org/10.23638/DMTCS-19-1-21 [4] T.R. Hagedorn, Magic rectangles revisited, Discrete Math. 207 (1999), no. 1-3, 65–72. https://doi.org/10.1016/S0012-365X(99)00041-2 [5] T. Harmuth, üeber magische quadrate und ¨ahnliche zahlenfiguren, Arch. Math. Phys 66 (1881), 286–313.
[6] T. Harmuth, üeber magische rechtecke mit ungeraden seitenzahlen, Arch. Math. Phys 66 (1881), 413–447.
[7] J. Haslegrave, Proof of a local antimagic conjecture, Discrete Math. Theor. Comput. Sci. 20 (2018), no. 1, Article ID: #18 https://doi.org/10.23638/DMTCS-20-1-18 [8] G.C. Lau, H.K. Ng, and W.C. Shiu, Affirmative solutions on local antimagic chromatic number, Graphs Combin. 36 (2020), no. 5, 1337–1354. https://doi.org/10.1007/s00373-020-02197-2 [9] G.C. Lau, W.C. Shiu, and H.K. Ng, On local antimagic chromatic number of cycle-related join graphs, Discuss. Math. Graph Theory 41 (2021), no. 1, 133–152 https://doi.org/10.7151/dmgt.2177 [10] M. Marsidi and I.H. Agustin, The local antimagic on disjoint union of some family graphs, J. Mat. Mantik 5 (2019), no. 2, 69–75. https://doi.org/10.15642/mantik.2019.5.2.69-75 | ||
|
آمار تعداد مشاهده مقاله: 105 تعداد دریافت فایل اصل مقاله: 585 |
||