Resumen
We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and Laplacian matrices of a digraph. The main results of this article are the determination of some minimal generator sets and the reduced Gröbner basis for the critical ideals of the complete graphs, the cycles and the paths. Also, we establish a bound between the number of trivial critical ideals and the stability and clique numbers of a graph.
Idioma original | Inglés |
---|---|
Páginas (desde-hasta) | 3870-3892 |
Número de páginas | 23 |
Publicación | Linear Algebra and Its Applications |
Volumen | 439 |
N.º | 12 |
DOI | |
Estado | Publicada - 15 dic. 2013 |
Publicado de forma externa | Sí |