Accessible spectrum of graphs

This paper computes eigenvalues of discrete complete hypergraphs and partitioned hypergraphs. We define positive equivalence relation on hypergraphs that establishes a connection between hypergraphs and graphs. With this regards it makes a connection between spectrum of graphs and spectrum of quotient of any hypergraphs. Finally, this study tries to construct spectrum of path trees via quotient of partitioned hypergraphs.