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
Controllability of Bandlimited Graph Processes Over Random Time Varying Graphs
TL;DR: In this paper, the authors consider the problem of controlling the network state when the topology varies randomly with time, and propose different control strategies and evaluate their effectiveness on synthetic network models and social networks.
Journal ArticleDOI
Bounds on normalized Laplacian eigenvalues of graphs
TL;DR: In this article, a simple connected graph of order n, where the normalized Laplacian eigenvalues of the graph G are obtained, is characterized and some new upper and lower bounds on are obtained.
Journal ArticleDOI
On spectral radius and energy of complete multipartite graphs
TL;DR: It is shown that for a fixed value of n, both the spectral radius and the energy of complete p -partite graphs are minimal for complete split graph C S and are maximal for Turan graph T.
Journal ArticleDOI
Ordering trees by the Laplacian coefficients
TL;DR: In this paper, a partial ordering of trees with diameters 3 and 4 by the Laplacian coefficients is proposed, motivated by a Mohar's paper, and the results are used to determine several orderings of trees.
Journal Article
Some notes on spectra of cographs
TL;DR: It is proved that the polynomial reconstruction of graphs whose vertex–deleted subgraphs have the second largest eigenvalue not exceeding √ 5−1 2 is unique.