The determinant of a unicyclic graph's neighborhood matrix (Q1765895): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q308665 |
||
Property / reviewed by | |||
Property / reviewed by: Alexander E. Guterman / rank | |||
Revision as of 15:36, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The determinant of a unicyclic graph's neighborhood matrix |
scientific article |
Statements
The determinant of a unicyclic graph's neighborhood matrix (English)
0 references
23 February 2005
0 references
Let \(G\) be a unicyclic graph with \(n\) vertices and a unique cycle, \(A(G)\) denotes the adjacency matrix of the graph \(G\). The algorithm for computing the determinant function of the matrix \(\alpha I_n+A(G)\) which uses \(O(n)\) arithmetic operations under some restrictions on the degrees of the vertices of the graph \(G\) is obtained. Among the corollaries from the above results the author points out the algorithms to compute the determinants of adjacency and neigborhood matrices and the characteristic polynomial for adjacency matrices.
0 references
adjacency matrix
0 references
neighborhood matrix
0 references
unicyclic graph
0 references
determinant
0 references
characteristic polynomial
0 references
algorithm
0 references