论文信息 - On the pseudo-inverse of the Laplacian of a bipartite graph

On the pseudo-inverse of the Laplacian of a bipartite graph

We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is based on the pseudo-inverse of the normalized Laplacian. (c) 2005 Elsevier Ltd. All rights reserved.

Paul Van Dooren | Ngoc-Diep Ho

[1] W. D. Cairns. THE MATHEMATICAL ASSOCIATION OF AMERICA. , 1917, Science.

[2] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] M. Randic,et al. Resistance distance , 1993 .