Open AccessBook
Spectra of graphs : theory and application
Reads0
Chats0
TLDR
The Spectrum and the Group of Automorphisms as discussed by the authors have been used extensively in Graph Spectra Techniques in Graph Theory and Combinatory Applications in Chemistry an Physics. But they have not yet been applied to Graph Spectral Biblgraphy.Abstract:
Introduction. Basic Concepts of the Spectrum of a Graph. Operations on Graphs and the Resulting Spectra. Relations Between Spectral and Structural Properties of Graphs. The Divisor of a Graph. The Spectrum and the Group of Automorphisms. Characterization of Graphs by Means of Spectra. Spectra Techniques in Graph Theory and Combinatories. Applications in Chemistry an Physics. Some Additional Results. Appendix. Tables of Graph Spectra Biblgraphy. Index of Symbols. Index of Names. Subject Index.read more
Citations
More filters
Journal ArticleDOI
Equiaromatic benzenoids: Arbitrarily large sets of isomers with equal ring currents
TL;DR: The notion of equiaromaticity is defined in this paper, which states that two polycyclic systems are equiaromorphic if their rings can be put into one-to-one correspondence such that corresponding π ring currents are equal.
Journal ArticleDOI
On distance integral graphs
TL;DR: This work characterize distance integral graphs in the classes of graphs similar to complete split graphs, which, together with relations between graph operations and distance spectra, allows us to exhibit many infinite families ofdistance integral graphs.
Journal ArticleDOI
Graphs with fourth Laplacian eigenvalue less than two
TL;DR: All connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize allconnected graphs with exactly three Laplacia eigenvalues no more than two.
Journal ArticleDOI
On the distribution of Laplacian eigenvalues of a graph
TL;DR: In this article, the authors present bounds on the number of Laplacian eigenvalues contained in various subintervals of [0, n] by using the matching number and edge covering number.
Journal ArticleDOI
Pseudo-distance-regularized graphs are distance-regular or distance-biregular
TL;DR: In this paper, the authors prove that a pseudo-distance-regular graph around each of its vertices is either distance-regular or distance-biregular, by using a combinatorial approach.