A disrespectful polynomial (Q809097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Trivalent orbit polynomial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orbit polynomial graphs of prime order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomials on graphs / rank | |||
Normal rank |
Revision as of 18:21, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A disrespectful polynomial |
scientific article |
Statements
A disrespectful polynomial (English)
0 references
1990
0 references
Let G be an orbit polynomial graph and p(x) a polynomial. Conditions were found at which p(G) is the adjacency matrix of a graph. Let H be another graph with \(VH=VG\). Then \(Aut (G)\subseteq Aut (H)\) if and only if \(H=p(G)\) for some polynomial p(x). Conditions were given at which p(x) respects spec(G). The conjecture by \textit{P. W. Weichsel} [Linear Algebra Appl. 93, 179-186 (1987; Zbl 0644.05037)] relating the automorphism groups and eigenvalues of a graph G and another graph generated from G by a polynomial was studied. This conjecture was found true for vertex- transitive graphs with a prime number of vertices. Examples were given where the conjecture is false.
0 references
adjacency matrix
0 references
automorphism groups
0 references
eigenvalues
0 references