Multiplicity of integer roots of polynomials of graphs (Q1902110): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127677603, #quickstatements; #temporary_batch_1722702569611 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127677603 / rank | |||
Normal rank |
Latest revision as of 02:39, 4 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiplicity of integer roots of polynomials of graphs |
scientific article |
Statements
Multiplicity of integer roots of polynomials of graphs (English)
0 references
14 November 1995
0 references
Let \(G\) be a graph and let \(\delta\) be the minimal degree of vertices in \(G\). Let \(B= D+ A\), where \(D\) is the diagonal matrix of vertex degrees and \(A\) is the adjacency matrix of \(G\). A combinatorial characterization is given for the multiplicity of \(\delta\) as the root of the permanental polynomial \(\text{per}(xI- B)\). If \(G\) is bipartite, this characterization extends to \(\text{per}(xI- L)\), where \(L= D- A\) is the Laplacian matrix of \(G\). These results are also extended to results about multiplicities of (arbitrary) integer roots of the permanental and the characteristic polynomials of both \(B\) and \(L\).
0 references
adjacency matrix
0 references
permanental polynomial
0 references
Laplacian matrix
0 references
multiplicities
0 references
integer roots
0 references
characteristic polynomials
0 references