If expressed as adjacency matrix every graph is a square matrix. And every square matrix has a characteristic polynomial. So that means: Every graph is also a p

If expressed as adjacency matrix every graph is a square matrix. And every square matrix has a characteristic polynomial. So that means: Every graph is also a polynomial! see https://mathworld.wolfram.com/CharacteristicPolynomial.html https://mathworld.wolfram.com/CharacteristicPolynomial.html