Abstract
ABSTRACT Let Π be an equitable partition of a graph G with k cells. If G has no equitable partition with fewer cells than Π, then Π is called a minimal partition of G and G is called a k-equitable graph. It is clear that 1-equitable graphs are regular graphs. In this paper, we investigate 2-equitable graphs with four distinct eigenvalues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
