Cordial Labeling of Corona Product of Paths and Fourth Order of Lemniscate Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i1.5470Keywords:
Cordial labeling, corona product, lemniscate, Social Networking, Network security, Edge ComputingAbstract
A graph $G = (V,E)$ is called cordial if it is possible to label the vertex by the function $f:V\rightarrow{0,1}$ and label the edges by $%f^*:E\rightarrow{0,1}$, where $f^*(uv)=(f(u)+f(v)) mod 2$, $u,v\in V$ so that $|v_0-v_1|\le 1$ and $|e_0-e_1|\le 1$.A lemniscate graph is a plane curve with a characteristic shape, consisting of two loops that meet at a central point as shown below. The curve is also known as the lemniscate of Bernoulli. A fourth order of lemniscate graph is a graph of two fourth order of circles that have two vertex in common. In this paper, we give the conditions that the corona product of paths and fourth order of lemniscate graphs be cordial.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Atef Abd El-hay, Khalid A. Alsatami, Ashraf ELrokh, Aya Rabie
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.