On the inverse of the adjacency matrix of a graph

DOI10.2478/spma-2013-0006zbMath1291.05120OpenAlexW1974594358MaRDI QIDQ2017188

Alexander Farrugia, Irene Sciriha, John Baptist Gauci

Publication date: 25 June 2014

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/spma-2013-0006

zbMATH Keywords

adjacency matrixnullityNSSDsingular graphSSP modelvertex-deleted subgraphsinverse of a graph

Mathematics Subject Classification ID

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

Related Items (7)

A novel method to construct NSSD molecular graphs ⋮ The polynomial reconstruction problem: the first 50 years ⋮ The Green’s function for the Hückel (tight binding) model ⋮ Two-graphs and NSSDs: an algebraic approach ⋮ Edge construction of molecular NSSDs ⋮ Non-singular graphs with a singular deck ⋮ Triangles in inverse NSSD graphs

Cites Work

• Interlacing eigenvalues and graphs
• A characterization of tridiagonal matrices
• Interlacing–extremal graphs
• Unnamed Item

This page was built for publication: On the inverse of the adjacency matrix of a graph