Polynomials on graphs (Q1102307)
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 4049685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomials on graphs |
scientific article; zbMATH DE number 4049685 |
Statements
Polynomials on graphs (English)
0 references
1987
0 references
Let G be a simple graph with adjacency matrix A and p(x) a polynomial with rational coefficients. If p(A) is a (0,1)-matrix, the graph whose adjacency matrix is p(A) is called a polynomial in G and is denoted by p(G). Polynomials in distance-regular graphs are determined in this paper. Automorphism groups and spectra of graphs and their polynomials are also studied.
0 references
adjacency matrix
0 references
polynomial
0 references
distance-regular graphs
0 references
Automorphism groups
0 references
spectra of graphs
0 references
0 references
0 references
0.92701554
0 references
0 references
