Forest matrices around the Laplacian matrix

Linear Algebra and Its Applications

Volumn 356, Issue 1-3, 2002, Pages 253-274

  Chebotarev, Pavel ^a   Agaev, Rafig ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

Eigenprojection; Generalized inverse; Laplacian matrix; Leverrier Faddeev method; Markov chain tree theorem; Matrix forest theorem; Matrix tree theorem; Spanning forest; Weighted digraph

Indexed keywords

CHAINS; DIRECTED GRAPHS; FORESTRY; GRAPH THEORY; INVERSE PROBLEMS; LAPLACE TRANSFORMS; MARKOV PROCESSES; STOCHASTIC SYSTEMS;

EIGENPROJECTIONS; FADDEEV; GENERALIZED INVERSE; LAPLACIAN MATRICES; MATRIX-TREE THEOREM; SPANNING FOREST; TREE THEOREM; WEIGHTED DIGRAPH;

MATRIX ALGEBRA;

EID: 84969165400     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00388-9     Document Type: Article

References (69)

1. R.P. Agaev, and P.Y. Chebotarev The matrix of maximum out forests and its applications Automation and Remote Control 61 2000 1424 1450
2. R.P. Agaev, and P.Y. Chebotarev Spanning forests of a digraph and their applications Automation and Remote Control 62 2001 443 466
3. R.B. Bapat Moore-Penrose inverse of the incidence matrix of a tree Linear and Multilinear Algebra 42 1997 159 167
4. R.B. Bapat, and G. Constantine An enumerating function for spanning forests with color restrictions Linear Algebra Appl. 173 1992 231 237
5. R.B. Bapat, J.W. Grossman, and D.M. Kulkarni Generalized matrix tree theorem for mixed graphs Linear and Multilinear Algebra 46 1999 299 312
6. A. Ben-Israel, and T.N.E. Greville Generalized Inverses: Theory and Applications 1974 Wiley New York
7. A. Berman, and R. Plemmons Nonnegative Matrices in the Mathematical Sciences 1979 Academic Press New York
8. N. Biggs Algebraic Graph Theory 1974 Cambridge University Press Cambridge
9. C.W. Borchardt über eine der Interpolation entsprechende Darstellung der Eliminations-Resultante Journal für die reine und angewandte Mathematik 57 1860 111 121
10. S. Chaiken A combinatorial proof of the all minors matrix tree theorem SIAM Journal on Algebraic and Discrete Methods 3 1982 319 329
11. S. Chaiken, and D.J. Kleitman Matrix tree theorems J. Combin.Theory, Series A 24 1978 377 381
12. P. Chebotarev, E. Shamis, The forest metrics for graph vertices, Discrete Mathematics, 2001 (accepted)
13. P.Y. Chebotarev, E.V. Shamis, Matrix-forest theorems, 1995 (unpublished)
14. P.Y. Chebotarev, and E.V. Shamis On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix 5th Conference of the International Linear Algebra Society 1995 Georgia State University Atlanta 30 31
15. P.Y. Chebotarev, and E.V. Shamis The matrix-forest theorem and measuring relations in small social groups Automation and Remote Control 58 1997 1505 1514
16. P.Y. Chebotarev, and E.V. Shamis On proximity measures for graph vertices Automation and Remote Control 59 1998 1443 1459
17. W.K. Chen Applied Graph Theory, Graphs and Electrical Networks second ed. 1976 North-Holland Amsterdam
18. (d) Appl. Math. Comput. 119 2001 147 160
19. T,S of a matrix A Linear Algebra Appl. 308 2000 85 107
20. F.R.K. Chung, and R.P. Langlands A combinatorial Laplacian with vertex weights J. Combin. Theory, Series A 75 1996 316 327
21. D.M. Cvetković, M. Doob, and H. Sachs Spectra of Graphs 1980 Academic Press New York
22. S.W. Drury, G.P.H. Styan, G.E. Subak-Sharpe, On spanning trees and terminal weight numbers, Report from the Department of Mathematics and Statistics 94-4, McGill University, Montreal, Queb., Canada, 1994
23. D.K. Faddeev, and V.N. Faddeeva Numerical Methods in Linear Algebra 1959 Dover New York
24. M. Fiedler Moore-Penrose involutions in the classes of Laplacians and simplices Linear and Multilinear Algebra 39 1995 171 178
25. M. Fiedler, and J. Sedláček W-basi&0301;ch orientovaných grafů Časopis Pěst. Mat. 83 1958 214 225
26. R. Forman Determinants of Laplacians on graphs Topology 32 1993 35 46
27. F.R. Gantmacher, Teoriya Matrits, second ed., Nauka, Moscow, 1966. (The first edition translated as: The Theory of Matrices, Vols. I and II, Chelsea, New York, 1959.)
28. V.E. Golender, V.V. Drboglav, and A.B. Rosenblit Graph potentials method and its application for chemical information processing J. Chem. Inform. Comput. Sci. 21 1981 196 204
29. J.C. Gower A modified Leverrier-Faddeev algorithm for matrices with multiple eigenvalues Linear Algebra Appl. 31 1980 61 70
30. F. Harary Graph Theory 1969 Addison-Wesley Reading, MA
31. R.E. Harte Spectral projections Irish Mathematical Society Newsletter 11 1984 10 15
32. R.E. Hartwig More on the Souriau-Frame algorithm and the Drazin inverse SIAM Journal on Applied Mathematics 31 1976 42 46
33. B.D. Jones, B.G. Pittel, and J.S. Verducci Tree and forest weights and their application to nonuniform random graphs The Annals of Applied Probability 9 1999 197 215
34. A. Kelmans, I. Pak, A. Postnikov, Tree and forest volumes of graphs, Rutcor Research Report 47-99, Rutgers Center for Operations Research, Rutgers University, Piscataway NJ, 1999
35. A.K. Kel'mans, The number of trees in a graph I, II, Automation and Remote Control 26 (1965) 2118-2129, 27 (1966) 233-241
36. A.K. Kelmans On the properties of the characteristic polynomial of a graph A.I. Berg, Kibernetiku - na sluzhbu kommunizmu (Cybernetics Should Serve Communism) vol. 4 1967 Energiya Moscow-Leningrad 27 41 in Russian
37. A.K. Kelmans, and V.M. Chelnokov A certain polynomial of a graph and graphs with an extremal number of trees J. Combin. Theory, Series B 16 1974 197 214
38. S.J. Kirkland, and M. Neumann On group inverses of M-matrices with uniform diagonal entries Linear Algebra Appl. 296 1999 153 170
39. S.J. Kirkland, M. Neumann, and B.L. Shader Distances in weighted trees and group inverse of Laplacian matrices SIAM J. Matrix Anal. Appl. 18 1997 827 841
40. J.J. Koliha Block diagonalization Mathematica Bohemica 126 2001 237 246
41. J.J. Koliha, and I. Straškraba Power bounded and exponentially bounded matrices Applications of Mathematics 44 1999 289 308
42. T. Leighton, R.L. Rivest, The Markov chain tree theorem, Computer Science Technical Report MIT/LCS/TM-249, Laboratory of Computer Science, MIT, Cambridge, MA, 1983
43. T. Leighton, and R.L. Rivest Estimating a probability using finite memory IEEE Transactions on Information Theory IT-32 1986 733 742
44. G. Marsaglia, and G.P.H. Styan Equalities and inequalities for ranks of matrices Linear and Multilinear Algebra 2 1974 269 292
45. J.S. Maybee, D.D. Olesky, P. van den Drissche, and G. Wiener Matrices, digraphs, and determinants SIAM J. Matrix Anal. Appl. 10 1989 500 519
46. R. Merris Doubly stochastic graph matrices Univ. Beograd. Publ. Electrotechn. Fak., Ser. Mat. 8 1997 64 71
47. R. Merris Doubly stochastic graph matrices II Linear and Multilinear Algebra 45 1998 275 285
48. C.D. Meyer Jr. Limits and the index of a square matrix SIAM J. Appl. Math. 26 1974 469 478
49. C.D. Meyer Jr. The role of the group generalized inverse in the theory of finite Markov chains SIAM Review 17 1975 443 464
50. C.D. Meyer Jr., and M.W. Stadelmaier Singular M-matrices and inverse positivity Linear Algebra Appl. 22 1978 139 156
51. M. Minoux A generalization of the all minors matrix tree theorem to semirings Discrete Mathematics 199 1999 139 150
52. J.W. Moon Counting Labelled Trees 1970 Canadian Mathematical Congress Montreal
53. J.W. Moon Some determinant expansions and the matrix-tree theorem Discrete Mathematics 124 1994 163 171
54. W. Myrvold Counting k-component forests of a graph Networks 22 1992 647 652
55. W.S. Percival The solution of passive electrical networks by means of mathematical trees Proceedings of the Institute of Electrical Engineers 100 1953 143 150
56. J.G. Propp, and D.B. Wilson How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph J. Algorithms 27 1998 170 217
57. U.G. Rothblum Computation of the eigenprojection of a nonnegative matrix at its spectral radius Mathematical Programming Study 6 1976 188 201
58. U.G. Rothblum A representation of the Drazin inverse and characterizations of the index SIAM J. Appl. Math. 31 1976 646 648
59. U.G. Rothblum Expansions of sums of matrix powers SIAM Review 23 1981 143 164
60. U.G. Rothblum Resolvent expansions of matrices and applications Linear Algebra Appl. 38 1981 33 49
61. A.J. Schwenk The adjoint of the characteristic matrix of a graph J. Combin., Inform. Syst. Sci. 16 1991 87 92
62. E.V. Shamis Graph-theoretic interpretation of the generalized row sum method Mathematical Social Sciences 27 1994 321 333
63. J.J. Sylvester, On the change of systems of independent variables, Quart. J. Pure Appl. Math. 1 (1857) 42-56, reprinted in: Collected Math. Papers, Cambridge 2 (1908) 65-85
64. W.T. Tutte The dissection of equilateral triangles into equilateral triangles Proceedings of the Cambridge Philosophical Society 44 1948 463 482
65. W.T. Tutte Graph Theory 1984 Addison-Wesley Reading, MA
66. Y. Wei A characterization and representation of the Drazin inverse SIAM J. Matrix Anal. Appl. 17 1996 744 747
67. Y. Wei, and H. Wu The representation and approximation for Drazin inverse J. Comp. Appl. Math. 126 2000 417 432
68. L. Zhang A characterization of the Drazin inverse Linear Algebra Appl. 335 2001 183 188
69. J.H.M. Wedderburn, Lectures on Matrices, Colloq. Publ., vol. 17, AMS, Providence, RI, 1934