In this article, we have calculated the coeffcients of the characteristic (determinantal) polynomial for a complete graph by considering the vertex number and using the eigenvalues of the normalized matrix. Additionally, we have obtained upper and lower bounds for the normalized eigenvalue of a complete graph. Furthermore, we present algorithms for these calculations.
© 2024 M. Abhishek, B. Prashanth, K. Permi, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons Attribution 4.0 License.