Distances in Weighted Trees and Group Inverse of Laplacian Matrices
From MaRDI portal
Publication:4377496
DOI10.1137/S0895479896298713zbMath0889.15004OpenAlexW1999661423MaRDI QIDQ4377496
Michael Neumann, Bryan L. Shader, Stephen J. Kirkland
Publication date: 10 February 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479896298713
Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Potentials of random walks on trees ⋮ Inverse Perron values and connectivity of a uniform hypergraph ⋮ Resistance characterizations of equiarboreal graphs ⋮ Acute perturbation of the group inverse ⋮ Some results on resistance distances and resistance matrices ⋮ Geometry of complex networks and topological centrality ⋮ A generalized inverse for graphs with absorption ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ Generalized inverses in graph theory ⋮ Bipartiteness and the least eigenvalue of signless Laplacian of graphs ⋮ A note on Moore–Penrose inverse of Laplacian matrix of graphs ⋮ Representations for the group inverse of anti-triangular block operator matrices ⋮ Performance and stability of direct methods for computing generalized inverses of the graph Laplacian ⋮ Linear estimation in models based on a graph ⋮ The sharpness of a lower bound on the algebraic connectivity for maximal graphs ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs ⋮ The effect on the algebraic connectivity of a tree by grafting or collapsing of edges ⋮ Resistance distances in extended or contracted networks ⋮ A tight upper bound on the spectral radius of bottleneck matrices for graphs ⋮ Moore-Penrose inverse of the incidence matrix of a distance regular graph ⋮ A minimax-condition for the characteristic center of a tree ⋮ Algebraic connectivity and the characteristic set of a graph ⋮ On graphs with equal algebraic and vertex connectivity ⋮ Characterization of symmetric \(M\)-matrices as resistive inverses ⋮ On a bound on algebraic connectivity: the case of equality ⋮ On operations in which graphs are appended to trees ⋮ Unnamed Item ⋮ Minimal ∞-norm of generalized inverses of the incidence matrix of a tree ⋮ Forest matrices around the Laplacian matrix ⋮ Extremal first passage times for trees ⋮ Maximizing the distance between center, centroid and characteristic set of a tree ⋮ On trees with perfect matchings ⋮ Semi-supervised learning with regularized Laplacian
This page was built for publication: Distances in Weighted Trees and Group Inverse of Laplacian Matrices
