000			01444nam a22001937a 4500
005			20240205115629.0
008			240205b ||||| |||| 00| 0 eng d
022			_a0019-5588
100			_aRather, Bilal Ahmad
245			_aOn Schatten p-norm of the distance matrices of graphs (Journal Article)
260			_aNew Delhi _b:Indian National Science Academy | Springer _c,2023
300			_a10112-1024p.
440			_aIndian Journal of Pure and Applied Mathematics _v, Volume 54: Number 4, December 2023
505			_a***______{For Hard Copy, Please visit Library.}________***
520			_aAbstract: For a connected simple graph G, the generalized distance matrix is defined by, where Tr(G) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix. For particular values of , we obtain the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix and other uncountable distance based matrices. Let be the eigenvalues of G and a real number, the Schatten p-norm is the p-th root of the sum of p-th powers of eigenvalues of, that is. In this paper, we obtain various bounds for in terms of different graph parameters and characterize the corresponding extremal graphs.
650			_aDistance matrix| Distance Laplacian matrix| Distance Signless Laplacian matrix| D matrix| Schatten p-norm| Ky Fan k norm
856			_uhttps://doi.org/10.1007/s13226-022-00317-7
942			_cPER
999			_c45407 _d45406