|
|
 |
| |
|
|
|
The Cordiality of Cone and Lemniscate Graphs |
|
|
|
PP: 1027-1034 |
|
|
|
doi:10.18576/amis/160620
|
|
|
|
Author(s) |
|
|
|
Ashraf Elrokh,
Yasser Elmshtaye,
Atef Abd El-hay,
|
|
|
|
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. |
|
|
|
|
|
|
|
