Abstract

In this paper, we determine the set of all distinct eigenvalues of the line graph which is induced by the first and second layers of the hypercube Qn, n>3. We show that this graph has precisely five distinct eigenvalues and all of its eigenvalues are integers. The main tool which we use in our work, is the equitable partition method in algebraic graph theory. We show how we can find, by using this method, the set of all distinct eigenvalues of a class of particular graphs.

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