Cordial Labeling of Corona Product of Paths and Fourth Order of Lemniscate Graphs

Authors

  • Atef Abd El-hay Mathematics and Computer Science Department, Faculty of Science Menoufia University, Menoufia, Egypt https://orcid.org/0000-0002-2793-5688
  • Khalid A. Alsatami Department of Mathematics, College of Science, Qassim University, Buraydah, KSA
  • Ashraf ELrokh
  • Aya Rabie Department of Planning Technique Center, Institute of National Planning, Cairo, Egypt

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i1.5470

Keywords:

Cordial labeling, corona product, lemniscate, Social Networking, Network security, Edge Computing

Abstract

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

2025-01-31

Issue

Section

Nonlinear Analysis

How to Cite

Cordial Labeling of Corona Product of Paths and Fourth Order of Lemniscate Graphs. (2025). European Journal of Pure and Applied Mathematics, 18(1), 5470. https://doi.org/10.29020/nybg.ejpam.v18i1.5470