A new method to compute the determinantal polynomial coefficients of a matrix (Symmetric Normalized Kirchhoff matrix) of a complete graph

M. Abhishek; B. Prashanth; K. Permi

doi:10.2478/jamsi-2024-0008

Abstract

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.

References

A. K. Kel’mans, Properties of the Characteristic polynomial of a graph, Kibernetiky na SlȈ u Kommunizmu, Emergija, Markova-Leningrand, 4(1967), 27-41(in Russian).
Search in Google Scholar Back to article
B. Prashanth, K. Nagendra Naik, K. R Rajanna, A remark on eigen values of Signed graph, Journal of Applied Mathematics, Statistics and Informatics15(1) (2019), 33-42. (ISSN (print): 1336-9180,(ISSN (on-line): 1339-0015, Poland)).
Search in Google Scholar Back to article
C. S. Oliveria, N. M. M. de Abreu, S. Jurkiewicz, The Characteristic polynomial of the Laplacian of graphs in(a,b)-linear classes, Linear Algebra and its Applications 356, 113-121 (2002), (ISSN:0024-3795).
Search in Google Scholar Back to article
D. Cvetkovic, P. Rowlinson, S. Simi’c: An Introduction to the Theory of Graph Spectra. Cambridge University Press, Cambridge(2010).
Search in Google Scholar Back to article
F. Harary, R. Z. Norman and D. W. Cartwright, Structural models: An introduction to the theory of directed graphs, Wiley Inter-Science, Inc., New York, 1965.
Search in Google Scholar Back to article
F. Harary, Graph Theory, Addison-Wesley Publishing Co., 1969.
Search in Google Scholar Back to article
G. T. Chartrand, Graphs as Mathematical Models, Prindle, Weber & Schmidt, Inc., Boston, Massachusetts 1977.
Search in Google Scholar Back to article
G. Davis, G. Chen, F. Hall, Z. Li, M. Stewart and K. Patel, An interlacing result on normalized Laplacian, SIAM J. Discrete Math. 18(2004),353-361.
Search in Google Scholar Back to article
I. M. Mladenov, M. D. Kotarov, J. G. Vassileva Popova, Method for Computing the Characteristic Polynomial, International Journal of Quantum Chemistry. 10(8),339-341 (1980), (ISSN:0020-7608-80).
Search in Google Scholar Back to article
J. P. Grossman, An eigenvalue bound for the Laplacian of a graph, Discrete Math. 300 (2005), 225-228.
Search in Google Scholar Back to article
I. Gutman. O. E. Polansky, Mathematical Concepts in Organic Chemistry. Springer Verlag., Berlin (1988).
Search in Google Scholar Back to article
U. Le Verrier: Sur les variations sculaires des lments des orbites pour les sept plantes principales, J. de Math. (1) 5, 230 (1840), Online
Search in Google Scholar Back to article
N. Trinajstic, Chemical Graph Theory, Vols. I and II, CRC, Boca Raton, FL,(1983).
Search in Google Scholar Back to article
N. Trinajstic, The characteristic polynomial of a chemical graph, J. Math. Chem. 2 (3), 197-215(1988).
Search in Google Scholar Back to article
U. J. J. Le Verrier, J. Math. 5 (95), 220 (1840).
Search in Google Scholar Back to article
P. S. Dwyer, Linear Computations, p. 225, Wiley, New York,(1951).
Search in Google Scholar Back to article
K. Balssubramanian, Spectra of chemical trees, Int. J. Quant. Chem. 21, 581-590(1982).
Search in Google Scholar Back to article
K. Balasubramanian, Characteristic polynomials of organic polymers and periodic structures, J. Comput. Chem. 6 (6), 656-661(1985).
Search in Google Scholar Back to article
B. Prashanth, K. Nagendra Naik and R. Salastina M. A remark on Normalized Laplacian eigen values of Signed graph, Journal of Applied Mathematics, Statistics and Informatics18(1) (2022), 109-124. (ISSN (print): 1336-9180,(ISSN (on-line): 1339-0015, Poland)).
Search in Google Scholar Back to article
N. Biggs, Algebraic Graph Theory, Cambridge, Univer. Press, 2nd edition, 1993.
Search in Google Scholar Back to article
F. Chung, Spectral Graph Theory, CBMS Regional Conference Series in Mathematics 92, AMS,Providence, 1997.
Search in Google Scholar Back to article

A new method to compute the determinantal polynomial coefficients of a matrix (Symmetric Normalized Kirchhoff matrix) of a complete graph

Abstract

Paradigm

My account