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

Applied Mathematics Letters

Volumn 18, Issue 8, 2005, Pages 917-922

  Ho, Ngoc Diep ^a   Van Dooren, Paul ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Bipartite graph; Laplacian; Pseudo inverse

Indexed keywords

CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY; VECTORS;

BIPARTITE GRAPHS; LAPLACIAN; PSEUDO-INVERSE; RELABELLING;

GRAPH THEORY;

EID: 19044386806     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2004.07.034     Document Type: Article

References (5)

1. P.G. Doyle, and J.L. Snell Random Walks and Electric Networks The Mathematical Association of America 1984
2. M. Saerens, F. Fouss, Computing similarities between nodes of a graph: Application to collaborative filtering, Technical Report, IAG, University of Louvain, 2004
3. D.J. Klein, and M. Randic Resistance distance Journal of Mathematical Chemistry 12 1993 81 95
4. G. Golub, and C. Van Loan Matrix Computations 3rd edition 1996 The Johns Hopkins University Press
5. A. Aho, J. Hopcroft, and J. Ullman The Design and Analysis of Computer Algorithms 3rd edition 1976 Addison-Wesley Publishing Company