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
New upper bounds for laplacian energy
TL;DR: In this paper, upper bounds and Nordhaus-Gaddum-type results for the Laplacian energy were obtained in terms of the number of vertices and the best possible.
Journal ArticleDOI
A relation between the multiplicity of the second eigenvalue of a graph laplacian, courant's nodal line theorem and the substantial dimension of tight polyhedral surfaces ∗
TL;DR: In this article, a relation between the multiplicity m of the second eigenvalue λ 2 of a Laplacian on a graph and a discrete analogue of Courant's nodal line theorem is discussed.
Posted Content
Families of line-graphs and their quantization
TL;DR: In this paper, it was shown that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family L^n(G).
Journal ArticleDOI
Spectral properties of the eccentricity matrix of graphs
TL;DR: This paper gives a condition to connected graphs with cut vertices so that their eccentricity matrices are irreducible, and determines the lower and upper bounds for the E -spectral radius of graphs, and identifies the corresponding extremal graphs.
Journal ArticleDOI
Remarks on hyperenergetic circulant graphs
Dragan Stevanović,Ivan Stankovic +1 more
TL;DR: In this paper, it was shown that for any given k1 < k2 < ··· < km almost all circulant graphs Ci(n, k1, k2,..., km) are hyperenergetic.