The cordiality of the sum and union of two fourth power of paths and cycles
Abstract A simple graph is called cordial if it has 0-1 labeling that satisfies certain conditions. In this paper, we examine the necessary and sufficient conditions for cordial labeling of the sum and union of two fourth power of paths and cycles.
Main Authors: | Ashraf Elrokh, Aya Rabie |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2021-01-01
|
Series: | Journal of the Egyptian Mathematical Society |
Subjects: | |
Online Access: | https://doi.org/10.1186/s42787-020-00111-6 |
Similar Items
-
On Cubic Roots Cordial Labeling for Some Graphs
by: Ashraf ELrokh, et al.
Published: (2023-04-01) -
A Novel Problem for Solving Permuted Cordial Labeling of Graphs
by: Ashraf ELrokh, et al.
Published: (2023-03-01) -
Strongly*-2 Divisor Cordial Labeling of Cycle Related Graphs
by: C. Jayasekaran, et al.
Published: (2023-12-01) -
All trees are six-cordial
by: Keith Driscoll, et al.
Published: (2017-04-01) -
Minimal Reinhard Zumkeller divisor cordial graphs
by: A . Ruby Priscilla, et al.
Published: (2023-06-01)