TY - JOUR
T1 - Construction And Spectra Of Non-Regular Minimal Graphs
JF - JEAS
JO - Journal of Engineering and Applied Sciences
SP - 30
LP - 41
M3 - 10.5455/jeas.2022050103
VL - 9
IS - 1
AU - Sabeena A. Kazi
AU - Harishch
AU - ra Ramane
Y1 - 2022
UR - http://jecasmu.org/?mno=139594
N2 - The number of distinct eigenvalues of the adjacency matrix of graph G is bounded below by d(G)+1, where d is the diameter of the graph. Graphs attaining this lower bound are known as minimal graphs. The spectrum of graph G, where G is a simple and undirected graph is the collection of different eigenvalues of the adjacency matrix with their multiplicities. This paper deals with the construction of non-regular minimal graphs, together with the study of their characteristic polynomial and spectra.
ER -