Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs
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 ne...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/8521810 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562549557559296 |
|---|---|
| author | Ashraf ELrokh Mohammed M. Ali Al-Shamiri Shokry Nada Atef Abd El-hay |
| author_facet | Ashraf ELrokh Mohammed M. Ali Al-Shamiri Shokry Nada Atef Abd El-hay |
| author_sort | Ashraf ELrokh |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-a19f52079a164185a490f103f7e40752 |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-a19f52079a164185a490f103f7e407522025-02-03T01:22:26ZengWileyJournal of Mathematics2314-47852022-01-01202210.1155/2022/8521810Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate GraphsAshraf ELrokh0Mohammed M. Ali Al-Shamiri1Shokry Nada2Atef Abd El-hay3Mathematics and Computer Science DepartmentDepartment of MathematicsMathematics and Computer Science DepartmentMathematics and Computer Science DepartmentA 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.http://dx.doi.org/10.1155/2022/8521810 |
| spellingShingle | Ashraf ELrokh Mohammed M. Ali Al-Shamiri Shokry Nada Atef Abd El-hay Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs Journal of Mathematics |
| title | Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs |
| title_full | Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs |
| title_fullStr | Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs |
| title_full_unstemmed | Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs |
| title_short | Cordial and Total Cordial Labeling of Corona Product of Paths and Second Order of Lemniscate Graphs |
| title_sort | cordial and total cordial labeling of corona product of paths and second order of lemniscate graphs |
| url | http://dx.doi.org/10.1155/2022/8521810 |
| work_keys_str_mv | AT ashrafelrokh cordialandtotalcordiallabelingofcoronaproductofpathsandsecondorderoflemniscategraphs AT mohammedmalialshamiri cordialandtotalcordiallabelingofcoronaproductofpathsandsecondorderoflemniscategraphs AT shokrynada cordialandtotalcordiallabelingofcoronaproductofpathsandsecondorderoflemniscategraphs AT atefabdelhay cordialandtotalcordiallabelingofcoronaproductofpathsandsecondorderoflemniscategraphs |