No label defined (Q4033253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 165464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 165464 |
Statements
16 May 1993
0 references
characteristic polynomial
0 references
adjacency matrix
0 references
numeration
0 references
Let \(G(\lambda)\) be the characteristic polynomial of the graph \(G\); \(G_ H\) be the graph obtained from \(G\) by removal of all vertices of the subgraph \(H\) and of the edges incident to them; \(A\) be the adjacency matrix according to a certain numeration of the vertices; \(i,j\) be the numbers of two vertices \(\alpha\) and \(\beta\), respectively. The following formulas are obtained: \[ (-1)^{i+j}|(\lambda I-A)^ i_ j|=\sum_{\alpha P\beta} G_ P(\lambda), \] where the upper (lower) index means the deletion of the corresponding line (column), and summation is taken over all simple chains with the ends \(\alpha\) and \(\beta\), \[ \left[\sum_{\alpha P\beta}G_ P(\lambda)\right]^ 2=G_ \alpha(\lambda)G_ \beta(\lambda)- G(\lambda)G_{\alpha\beta}(\lambda). \]
0 references