We investigate ideals of vertex covers for the edge ideals associated to considerable classes of connected graphs with loops and exhibit algebraic information about them, such as the existence of linear quotients, the computation of invariant values, and the Cohen–Macaulay property. These algebraic procedures are good instruments for evaluating situations of minimal node coverings in networks.
Vertex covers in graphs with loops
M. Imbesi;M. La Barbiera
2018-01-01
Abstract
We investigate ideals of vertex covers for the edge ideals associated to considerable classes of connected graphs with loops and exhibit algebraic information about them, such as the existence of linear quotients, the computation of invariant values, and the Cohen–Macaulay property. These algebraic procedures are good instruments for evaluating situations of minimal node coverings in networks.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Reprint.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
126.2 kB
Formato
Adobe PDF
|
126.2 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
