@article{On the Spectral-Equipartite Graphs and Eccentricity-Equipartite Graphs_2021, place={Maryland, USA}, volume={14}, url={https://www.ejpam.com/index.php/ejpam/article/view/3928}, DOI={10.29020/nybg.ejpam.v14i2.3928}, abstractNote={
Let G = (V, E) be a graph of order 2n. If A âŠ† V and hAi âˆ¼= hV \Ai, then A is said to be isospectral. If for every n-element subset A of V we have hAi âˆ¼= hV \Ai, then we say that G is spectral-equipartite. In [1], Igor Shparlinski communicated with Bibak et al., proposing a full characterization of spectral-equipartite graphs. In this paper, we gave a characterization of disconnected spectral-equipartite graphs. Moreover, we introduced the concept eccentricity-equipartite graphs.
}, number={2}, journal={European Journal of Pure and Applied Mathematics}, year={2021}, month={May}, pages={358–365} }