التفاصيل البيبلوغرافية
| العنوان: |
Analysing Edge-Equitable Antimagic connection number of certain Graph families. |
| المؤلفون: |
K., Abirami, N., Mohanapriya, Dafik |
| المصدر: |
International Journal of Open Problems in Computer Science & Mathematics; Mar2024, Vol. 17 Issue 1, p1-14, 14p |
| مصطلحات موضوعية: |
GRAPH labelings, GRAPH coloring, FAMILIES |
| مستخلص: |
The edge-equitable antimagic coloring has undergone comprehensive investigation across multiple graph structures, revealing that its outcomes align optimally with its equitable chromatic index. A graph, labeled using antimagic labeling, and satisfying the conditions: (i) no two adjacent edges incident on a vertex share the same edge weight, and (ii) for any distinct values i and j, the absolute difference between the cardinalities of the color classes associated with the edge weights is limited to no more than 1, is said to possess an edge-equitable antimagic coloring. This paper analyses the above coloring in specific graph families, that includes the triangular ladder graph (T Lp), open triangular ladder graph (OT Lp), comb graph (P + p ), and double comb graph (P ++ p ). [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Open Problems in Computer Science & Mathematics is the property of International Journal of Open Problems in Computer Science & Mathematics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
