Cordial Labeling of Goldberg Snark and its related Graphs
Abstract
In graph theory, a Snark is a connected, bridgeless, Cubic graph that cannot be edge-colored with only three colors. Additionally, to avoid some trivial cases, a Snark is typically required to have a girth of minimum five and a cyclic connectivity of minimum four. In this paper, we investigate the Cordial labeling, for one of the modified structures of Snark graph which is known as Goldberg Snark graph. Moreover, a few special forms of Goldberg Snark graph also admit the Cordial labeling.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.