A q-analogue of the distance matrix of a tree

Linear Algebra and Its Applications

Volumn 416, Issue 2-3, 2006, Pages 799-814

  Bapat, R B ^a   Lal, A K ^b   Pati, Sukanta ^c  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

Block matrix; Determinant; Distance matrix; Laplacian matrix; Tree

Indexed keywords

FORMAL LOGIC; INVERSE PROBLEMS; LAPLACE TRANSFORMS; TREES (MATHEMATICS);

BLOCK MATRIX; DETERMINANT; DISTANCE MATRIX; LAPLACIAN MATRIX;

MATRIX ALGEBRA;

EID: 33747062185     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.12.023     Document Type: Article

References (8)

1. Bapat R.B., Kirkland S.J., and Neumann M. On distance matrices and Laplacians. Linear Algebra Appl. 401 (2005) 193-209
2. Bapat R.B., and Raghavan T.E.S. In: Rota G.C. (Ed). Nonnegative Matrices and Applications. Encyclopedia of Mathematics and its Applications vol. 64 (1997), Cambridge University Press, Cambridge, London
3. Fiedler M. Some inverse problems for elliptic matrices with zero diagonal. Linear Algebra Appl. 332-334 (2001) 197-204
4. Graham R.L., and Lovasz L. Distance matrix polynomials of trees. Adv. Math. 29 1 (1978) 60-88
5. Graham R.L., and Pollak H.O. On the addressing problem for loop switching. Bell. System Tech. J. 50 (1971) 2495-2519
6. Harary F. Graph Theory (1969), Addison-Wesley, New York
7. Hogben L. Spectral graph theory and the inverse eigenvalue problem of a graph. Electron. J. Linear Algebra 14 January (2005) 12-31
8. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press, Cambridge, London