On the Spectral-Equipartite Graphs and Eccentricity-Equipartite Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i2.3928Keywords:
spectral-equipartite, eccentricity-equipartite, isospectralAbstract
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.
Downloads
Published
2021-05-18
Issue
Section
Nonlinear Analysis
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
On the Spectral-Equipartite Graphs and Eccentricity-Equipartite Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(2), 358-365. https://doi.org/10.29020/nybg.ejpam.v14i2.3928