Cordial Labeling of Goldberg Snark and its related Graphs

Bansari. J. Rayjada, Jekil. A. Gadhiya, Mahadityasinh. A. Sarvaiya

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…