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

DOI10.1016/J.AML.2004.07.034MaRDI QIDQ812774zbMATH OpenOpenAlexFDO

Authors Ngoc-Diep Ho, Paul van Dooren

Publication date 24 January 2006

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2004.07.034

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cited in

(9)

• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
• Algebraic connectivity and disjoint vertex subsets of graphs
• The Moore-Penrose inverse of the normalized graph Laplacian
• Perturbations of discrete elliptic operators
• Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications
• Global registration of multiple point clouds using semidefinite programming
• Combinatorial versus algebraic formulae for the Moore-Penrose inverse of a Laplacian matrix of a threshold graph
• Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
• Non-degenerate rigid alignment in a patch framework

This page was built for publication: On the pseudo-inverse of the Laplacian of a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812774)