Cordial Labeling of Goldberg Snark and its related Graphs
Combinatorics
2025-11-13 v1
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.
Cite
@article{arxiv.2511.08664,
title = {Cordial Labeling of Goldberg Snark and its related Graphs},
author = {Bansari. J. Rayjada and Jekil. A. Gadhiya and Mahadityasinh. A. Sarvaiya},
journal= {arXiv preprint arXiv:2511.08664},
year = {2025}
}
Comments
Submitted to Discrete Mathematics and Theoretical Computer Science (DMTCS)