Sign Up to like & get
recommendations!
1
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14050899
Abstract: It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. A graph is d-extremal (resp. dα-extremal) if it has diameter d and exactly d+1 distinct eigenvalues (resp. α-eigenvalues), and…
read more here.
Keywords:
bidegreed split;
distinct eigenvalues;
split graphs;
characterization bidegreed ... See more keywords