Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs

Ashraf ELrokh, Mohammed M. Ali Al-Shamiri, Shokry Nada, Atef Abd El-hay and M. T. Rahim

Journal of Mathematics, 2022, vol. 2022, 1-9

Abstract: A simple graph is called cordial if it admits 0-1 labeling that satisfies certain conditions. The second order of lemniscate graph is a graph of two second order of circles that have one vertex in common. In this paper, we introduce some new results on cordial labeling, total cordial, and present necessary and sufficient conditions of cordial and total cordial for corona product of paths and second order of lemniscate graphs.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/8521810.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/8521810.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:8521810

DOI: 10.1155/2022/8521810

Access Statistics for this article

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