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.
Characteristic, admittance and matching polynomials of an antiregular graph
MUNARINI, EMANUELE
2009-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
AADM-Vol3-No1-157-176.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
229.7 kB
Formato
Adobe PDF
|
229.7 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
