Volume 6 • Issue 2 • PP: 08-16 • 2023
A Study of the Eigenvalues of the Matrix Of Distance Reciprocals in K[r, n-r] And The Cycle C_n
View PDF Abstract
This paper Deals with the complete bipartite graph K(r, n-r) and the cycle . The matrix of concern is the matrix B which is the (n, n) matrix and whose non zero entries are the reciprocals of the non zero entries of the distance matrix D. A complete characterization of the spectrum of B and a set of n independent eigenvectors of B will be presented. Two special cases will be mentioned, namely the star K(1, n-1) and the graph K(2, n-2). We will also look at the case of infinite graph, i. e if the size n grows big while r stays finite. Finally, some numerical data will be presented. As for the cycle, we present the complete set of eigenvalues of the matrix B.
Keywords
References
[1]Behzad M. et al. (1979): Graphs and Digraphs. Prindle, Weber and Shmidt. Boston. U.S.A
[2]Lancaster M. et al. (1985): Theory of Matrices. Second edition. Academic Press. New York. NY. U.S.A
[3]Richard Bellman (1985): Introduction to Matrix Theory. Siam. Pheladelphia. PA. U.S.A
[4]Robin L. Wilson et al. (1978): Selected Topics in Graph Theory. Academic Press. New York. U.S.A
[5]Ruzieh S. (1989): Some Applications of Matrices Related to Graphs. Unpublished Ph. D dissertation. Clarkson University. Potsdam. NY. U.S.A
[6]Trinajstic N. et al. (1983): On the Distance Polynomial of a Graph. Aplikace Matimatiky, 28. Pp 357 - 363
Cite This Article
Choose your preferred format