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