Rather, Bilal Ahmad creator text New Delhi :Indian National Science Academy | Springer ,2023 monographic eng

print

10112-1024p. Abstract: 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. ***______{For Hard Copy, Please visit Library.}________*** Distance matrix| Distance Laplacian matrix| Distance Signless Laplacian matrix| D matrix| Schatten p-norm| Ky Fan k norm 0019-5588 https://doi.org/10.1007/s13226-022-00317-7 https://doi.org/10.1007/s13226-022-00317-7 240205 20240205115629.0