The Cordiality of Cone and Lemniscate Graphs

Authors

Ashraf Elrokh, Department of Mathematics, Faculty of Science, Menoufia University, Shebeen Elkom, EgyptFollow
Yasser Elmshtaye, Department of Mathematics, Faculty of Science and Arts, Mohayel Assir, King Khalid University, Abha, KSAFollow
Atef Abd El-hay, Department of Mathematics, Faculty of Science, Menoufia University, Shebeen Elkom, EgyptFollow

Author Country (or Countries)

Egypt

Abstract

A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ 1 and |e0 − e1 | ≤ 1. In this paper we present necessary and sufficient conditions for cone and lemniscate graphs to be cordial.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/160620

Recommended Citation

Elrokh, Ashraf; Elmshtaye, Yasser; and Abd El-hay, Atef (2022) "The Cordiality of Cone and Lemniscate Graphs," Applied Mathematics & Information Sciences: Vol. 16: Iss. 5, Article 20.
DOI: http://dx.doi.org/10.18576/amis/160620
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss5/20