On the inverse of the adjacency matrix of a graph

DOI10.2478/SPMA-2013-0006zbMATH Open1291.05120OpenAlexW1974594358MaRDI QIDQ2017188FDOQ2017188

Authors: Alexander Farrugia, John Baptist Gauci, Irene Sciriha 

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

Recommendations

• Triangles in inverse NSSD graphs
• Non-singular graphs with a singular deck
• The adjacency matrices of complete and nutful graphs
• Edge construction of molecular NSSDs
• Complete graphs with zero diagonal inverse

zbMATH Keywords

adjacency matrixnullitysingular graphvertex-deleted subgraphsinverse of a graphNSSDSSP model

Mathematics Subject Classification ID

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

Cites Work

• Interlacing eigenvalues and graphs
• Title not available (Why is that?)
• A characterization of tridiagonal matrices
• Interlacing–extremal graphs

Cited In (13)

• Two-graphs and NSSDs: an algebraic approach
• The Green’s function for the Hückel (tight binding) model
• Title not available (Why is that?)
• Non-singular graphs with a singular deck
• Matrices with a transitive graph and inverse M-matrices
• The Group Inverse of the Laplacian Matrix of a Graph
• Triangles in inverse NSSD graphs
• An inverse formula for the distance matrix of a wheel graph with an even number of vertices
• Edge construction of molecular NSSDs
• Title not available (Why is that?)
• Invertibility of adjacency matrices for random \(d\)-regular graphs
• A novel method to construct NSSD molecular graphs
• The polynomial reconstruction problem: the first 50 years

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

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