آمار
| تعداد نشریات | 5 |
| تعداد شماره‌ها | 115 |
| تعداد مقالات | 1,304 |
| تعداد مشاهده مقاله | 1,290,246 |
| تعداد دریافت فایل اصل مقاله | 1,137,324 |
Graceful Coloring of some Corona graphs - An algorithmic approach | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 25 مرداد 1403 اصل مقاله (418.48 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2024.29155.1866 | ||
| نویسندگان | ||
| Laavanya D؛ Devi Yamini S* | ||
| Vellore Institute of Technology, Chennai, Tamil Nadu, India | ||
| چکیده | ||
| A graceful $k$-coloring of a non-empty graph G is a proper vertex coloring with $k$ colors that induces a proper edge coloring, where the color for an edge $uv$ is the absolute difference between the colors assigned to the vertices $u$ and $v$. The minimum $k$ for which $G$ admits a graceful $k$-coloring is called the graceful chromatic number of $G$ ($\chi_ {g} (G)$). The problem of determining the graceful chromatic number for some corona graphs with the related coloring algorithms are studied in this paper. | ||
| کلیدواژه‌ها | ||
| Graceful coloring؛ Graceful chromatic number؛ Corona graphs | ||
| مراجع | ||
|
[1] R. Alfarisi, Dafik, R.M. Prihandini, R. Adawiyah, E.R. Albirri, and I.H. Agustin, Graceful chromatic number of unicyclic graphs, J. Phys. Conf. Ser. 1306 (2019), no. 1, Article ID: 012039. https://dx.doi.org/10.1088/1742-6596/1306/1/012039 [2] Z. Bi, A. Byers, S. English, E. Laforge, and P. Zhang, Graceful colorings of graphs, J. Combin. Math. Combin. Comput. 101 (2017), 101–119.
[3] A.D. Byers, Graceful Colorings and Connection in Graphs, Western Michigan University, 2018.
[4] S. English and P. Zhang, On graceful colorings of trees, Math. Bohem. 142 (2017), no. 1, 57–73. http://doi.org/10.21136/MB.2017.0035-15 [5] J.A. Gallian, A dynamic survey of graph labeling, Electron. J. Combin. 1 (2018), no. Dynamic Surveys, #DS6.
[6] S.W. Golomb, How to Number a Graph, Graph Theory and Computing (R.C.Read, ed.), Academic Press, 1972, pp. 23–37. https://doi.org/10.1016/B978-1-4832-3187-7.50008-8 [7] F. Harary and R. Frucht, On the corona of two graphs, Aequationes Math. 4 (1970), 322–325. https://doi.org/10.1007/BF01844162 [8] D. Laavanya and S.D. Yamini, A structural approach to the graceful coloring of a subclass of trees, Heliyon 9 (2023), no. 9, Article ID: e19563. https://doi.org/10.1016/j.heliyon.2023.e19563 [9] D. Laavanya and S.D. Yamini, Graceful coloring of ladder graphs, TWMS J. Apll. Eng. Math. 14 (2024), no. 3, 991–1001.
[10] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome), 1967, pp. 349–355.
[11] R.J. Wilson, Introduction to Graph Theory, Longman Group Ltd, London, 1996. | ||
|
آمار تعداد مشاهده مقاله: 120 تعداد دریافت فایل اصل مقاله: 230 |
||