This work studies, in the degree q<=6 , the paths of length (q−1) of a connected graph G and the generators of the corresponding generalized graph ideal I_q(G), using only the incidence matrix of G. Such a problem is known for generalized graph ideals when q<=4 . The extension to higher degrees is made by applying different techniques of computation in the proofs.
q-PATHS OF A GRAPH AND INCIDENCE MATRIX II
IMBESI, Maurizio
2008-01-01
Abstract
This work studies, in the degree q<=6 , the paths of length (q−1) of a connected graph G and the generators of the corresponding generalized graph ideal I_q(G), using only the incidence matrix of G. Such a problem is known for generalized graph ideals when q<=4 . The extension to higher degrees is made by applying different techniques of computation in the proofs.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
