Type I conjecture for nontrivially unstable circulant graphs of order divisible by eight
Type I conjecture for nontrivially unstable circulant graphs of order divisible by eight
Let be a positive integer divisible by , and let be a circulant graph with connection set . Assume that is nontrivially unstable, meaning unstable in the paper's nontrivial sense, and recall that Type I is one of the paper's instability types.
Type I conjecture. Every such graph is of Type I.
The conjecture would rule out Type II examples among nontrivially unstable circulant graphs whose order is divisible by . The supplied text does not provide evidence that this assertion has been proved or disproved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Junyang Zhang, “Graph product and the stability of circulant graphs”, arXiv:2504.05721 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.