Asymptotic Fibonacci cordial labeling conjecture for circulant graphs
Let be a circulant graph on vertices with connection set . Here, “small” means that is a connection set whose size is small relative to , although no precise threshold is specified in the source. Asymptotic Fibonacci cordial labeling conjecture. For large , almost every circulant graph with a “small” connection set admits a Fibonacci cordial labeling. This conjecture proposes an asymptotic abundance of Fibonacci cordial labelings for sparse or otherwise small-connection-set circulant graphs; the source provides no resolution or precise meaning of “almost every” and “small.”
References
- Sarbari Mitra and Soumya Bhoumik, “A Study of Fibonacci Cordial Labeling in Structured Graph Families”, arXiv:2509.01823 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.