Article
Open Access
On the inverse of the adjacency matrix of a graph
-
Alexander Farrugia
Published/Copyright:
November 29, 2013
Received: 2013-8-25
Accepted: 2013-11-13
Published Online: 2013-11-29
©2013 Versita Sp. z o.o.
Articles in the same Issue
- Nonnegative definite hermitian matrices with increasing principal minors
- Factorizable matrices
- A note on the determinant of a Toeplitz-Hessenberg matrix
- A note on majorization transforms and Ryser’s algorithm
- Pairs of k-step reachability and m-step observability matrices
- On the inverse of the adjacency matrix of a graph
- An approach based on matrix polynomials for linear systems of partial differential equations
Keywords for this article
singular graph;
adjacency matrix;
nullity;
SSP model;
inverse of a graph;
vertex–deleted subgraphs;
NSSD
Articles in the same Issue
- Nonnegative definite hermitian matrices with increasing principal minors
- Factorizable matrices
- A note on the determinant of a Toeplitz-Hessenberg matrix
- A note on majorization transforms and Ryser’s algorithm
- Pairs of k-step reachability and m-step observability matrices
- On the inverse of the adjacency matrix of a graph
- An approach based on matrix polynomials for linear systems of partial differential equations
