The cordiality of the sum and union of two fourth power of paths and cycles

Abstract

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.

Keywords

• Fourth power
• Sum graph
• Union graph
• Cordial graph