Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers

M. A. AbdAllah, S. I. Nada, M. M. A. Al-Shamiri and M. A. Afify

Journal of Mathematics, 2025, vol. 2025, 1-5

Abstract: A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions. The purpose of this paper is to study the cyclic cordiality of Ln,m and their second powers Ln,m2. Our verification goes through by using the concept of finite cyclic groups.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2025/8448683.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2025/8448683.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:8448683

DOI: 10.1155/jom/8448683

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().