User Settings
Article

Graceful Labelings of Graphs Related to Circuits of Length 4

0

TL;DRAbstract

The aim of the paper is to find graceful labeling for the graphs nC4, nC4 o 2Pn, nP2  P2n, its mirror image, nC4  2P2n  (n1)P2, and nC4  2P2n  (n-1)P2  (n-1)P3.

Chat with Paper

AI Agents for this Paper

The aim of the paper is to find graceful labeling for the graphs nC4, nC4 o 2Pn, nP2  P2n, its mirror image, nC4  2P2n  (n1)P2, and nC4  2P2n  (n-1)P2  (n-1)P3.

Keywords

Computer scienceImage (mathematics)CombinatoricsArtificial intelligenceMathematics

Chat

Click to start Chat