Abstract

Operating only by means of the incidence matrix of a connected graph G, a new algebraic combinatorial method for determining the paths of length (q−1) of G together with the generators of the corresponding generalized graph ideal Iq(G) is discussed and developed. The stated formulae are obtained and shown even by changing techniques appropriately when the difficulties of calculation increased.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call