آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 123 |
| تعداد مقالات | 1,578 |
| تعداد مشاهده مقاله | 1,707,644 |
| تعداد دریافت فایل اصل مقاله | 1,590,965 |
Characterization of product cordial dragon graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 14، دوره 9، شماره 4، اسفند 2024، صفحه 805-811 اصل مقاله (372.45 K) | ||
| نوع مقاله: Short notes | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2023.27882.1384 | ||
| نویسندگان | ||
| Mukti Acharya؛ Joseph Varghese Kureethara* | ||
| Department of Mathematics, Christ University, Bangalore, India | ||
| چکیده | ||
| The vertices of a graph are to be labelled with 0 or 1 such that each edge gets the label as the product of its end vertices. If the number of vertices labelled with 0's and 1's differ by at most one and if the number of edges labelled with 0's and 1's differ by at most by one, then the labelling is called product cordial labelling. Complete characterizations of product cordial dragon graphs are given. We also characterize dragon graphs whose line graphs are product cordial. | ||
| کلیدواژهها | ||
| Cordial graph؛ Binary labeling؛ Line graph؛ Dragon graph | ||
| مراجع | ||
|
[1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin. 23 (1987), 201–207.
[2] N. Inayah, A. Erfanian, and M. Korivand, Total product and total edge product cordial labelings of dragonfly graph (dgn), J. Math. 2022 (2022), no. 1, Artice ID: 3728344. https://doi.org/10.1155/2022/3728344
[3] M. Sundaram, R. Ponraj, and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure Appl. Sci. 23E (2004), no. 1, 155–163. | ||
|
آمار تعداد مشاهده مقاله: 615 تعداد دریافت فایل اصل مقاله: 2,001 |
||