تعداد نشریات | 7 |
تعداد شمارهها | 102 |
تعداد مقالات | 1,142 |
تعداد مشاهده مقاله | 1,051,043 |
تعداد دریافت فایل اصل مقاله | 871,186 |
Characterization of Product Cordial Dragon Graphs | ||
Communications in Combinatorics and Optimization | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 24 مرداد 1402 اصل مقاله (369.9 K) | ||
نوع مقاله: Original paper | ||
شناسه دیجیتال (DOI): 10.22049/cco.2023.27882.1384 | ||
نویسندگان | ||
Mukti Acharya1؛ Joseph Varghese Kureethara* 2 | ||
1Department of mathematics, Christ University, Bangalore India. | ||
2Christ University | ||
چکیده | ||
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] M. Sundaram, R. Ponraj, and S. Somasundaram, Product cordial labeling of graphs, Bull. Pure Appl. Sci. 23E (2004), no. 1, 155–163. | ||
آمار تعداد مشاهده مقاله: 180 تعداد دریافت فایل اصل مقاله: 705 |