Open AccessOn the Spectral-Equipartite Graphs and Eccentricity-Equipartite Graphs
Author(s) -
Arnel M. Yurfo,
Joel G. Adanza,
Michael Jr. Patula Baldado
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i2.3928
Subject(s) - mathematics , isospectral , combinatorics , graph , pathwidth , characterization (materials science) , discrete mathematics , indifference graph , spectral properties , pure mathematics , line graph , physics , optics , astrophysics
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.