Circulant graphs with \(\det(-A(G))=-\deg(G)\): Codeterminants with \(K_n\) (Q5956242)

The paper continues investigation of the question: Which graphs have the same determinant as the complete graph (with the same number of vertices)? It has been conjectured by \textit{X. Yong} [Linear Algebra Appl. 295, No. 1-3, 73-80 (1999; Zbl 0931.05056)] that there are no such noncomplete graphs, and shortly after \textit{D. D. Olesky, P. van den Driessche} and \textit{J. H. Verner} [Linear Algebra Appl. 312, No. 1-3, 191-195 (2000; Zbl 0958.05089)] presented a sequence of circulant graphs that are counterexamples to this conjecture. Exploiting further determinantal properties of circulant graphs, the author shows that for each \(m\in N\) there exists an integer \(N(m)\) and \(m\) nonisomorphic graphs such that each of them has the same determinant as \(K_{N(m)}\).