Abstract
Let \Pi be an equitable partition of a graph G with k cells. If G has no equitable partition with fewer cells than \Pi, then \Pi 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.
Type
Publication
In Linear and Multilinear Algebra
Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software.
Create your slides in Markdown - click the Slides button to check out the example.
Supplementary notes can be added here, including code, math, and images.
Lu Lu(鲁卢)
Associate Professor, PhD Supervisor
My research interests include algebraic graph theory, spectral graph theory and group theory.