No abstract

No abstract

No abstract

An antiregular graph is a simple graph with the maximum number of vertices with different degrees. In this paper we study the characteristic polynomial, the admittance (or Laplacian) polynomial and the matching polynomial of a connected antiregular graph. For these polynomials we obtain recurrences and explicit formulas. We also obtain some spectral properties. In particular, we prove an interlacing property for the eigenvalues and we give some bounds for the energy.

No abstract