Let G = Cn(S) be a circulant graph on n vertices. In this paper we characterize chordal circulant graphs and then we compute ν(G), the induced matching number of G. The latter are useful in bounding the Castelnuovo–Mumford regularity of the edge ideal I(G) of G.
Chordal circulant graphs and induced matching number
Romeo, Francesco
2020-01-01
Abstract
Let G = Cn(S) be a circulant graph on n vertices. In this paper we characterize chordal circulant graphs and then we compute ν(G), the induced matching number of G. The latter are useful in bounding the Castelnuovo–Mumford regularity of the edge ideal I(G) of G.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ChordalCirculant.pdf
accesso aperto
Licenza:
Copyright dell'editore
Dimensione
305.43 kB
Formato
Adobe PDF
|
305.43 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
