Abstract

Characteristic polynomial coefficients of three classes of graph, namely Ln + n(p), Cn + n(p) and K 1,n-1 + n(p), which are known to have reciprocal pairs of eigenvalues, have been shown to be generated by simple manipulation of the Pascal's triangle.

Full Text
Published version (Free)

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