A formula for all minors of the adjacency matrix and an application
We supply a combinatorial description of any minor of the adjacency matrix of a graph. This description is then used to give a formula for the determinant and inverse of the adjacency matrix, A(G), of a graph G, whenever A(G) is invertible, where G is formed by replacing the edges of a tree by path...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2014-06-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/spma.2014.2.issue-1/spma-2014-0009/spma-2014-0009.xml?format=INT |