Combinatorial versus algebraic formulae for the Moore-Penrose inverse of a Laplacian matrix of a threshold graph

DOI10.1016/J.CAM.2023.115714MaRDI QIDQ6489230

Jovana Nikolov Radenković, Unnamed Author, Abdullah Al-Azemi, Milica Anđelić

Publication date: 19 April 2024

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Laplacian spectrumMoore-Penrose inversethreshold graphequitable partition

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Eigenvalue location for chain graphs
• Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix
• On the pseudo-inverse of the Laplacian of a bipartite graph
• Generalized inverses of symmetric \(M\)-matrices
• Degree maximal graphs are Laplacian integral
• Fast algorithms for indices of nested split graphs approximating real complex networks
• The Moore-Penrose inverse of symmetric matrices with nontrivial equitable partitions
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Moore-penrose inverse of the incidence matrix of a tree
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Moore-Penrose inverse of the signless Laplacians of bipartite graphs
• Chain graph sequences and Laplacian spectra of chain graphs

This page was built for publication: Combinatorial versus algebraic formulae for the Moore-Penrose inverse of a Laplacian matrix of a threshold graph