Abstract
For any integer n greater than or equal to two, two intimately related graphs on the vertices of the n-dimensional cube are introduced. All of their eigenvalues are found to be integers, and the largest and the smallest ones are also determined. As a byproduct, certain kind of generating function for their spectra is introduced and shown to be quite effective to compute the eigenvalues of some broader class of adjacency matrices of graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have