On the Spectral-Equipartite Graphs and Eccentricity-Equipartite Graphs
Keywords:spectral-equipartite, eccentricity-equipartite, isospectral
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 , 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.
How to Cite
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.