
Let G = (V, E) be a unicyclic simple undirected graph. In this paper, we investigate the spectra of a particular class of unicyclic graphs G(q, n1) where q is the size of the unique cycle. Each vertex of the unique cycle is attached to n1 vertices. We provide the " exact values " of the extremal eigenvalues of the adjacency matrix A and the Laplacian matrix L of G, in contrast to lower and upper bounds reported in the literature.
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Algebraic Connectivity, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA], Laplacian eigenvalues, Unicyclic graph, Circulant matrices
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Algebraic Connectivity, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA], Laplacian eigenvalues, Unicyclic graph, Circulant matrices
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
