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
Kragujevac trees and their energy
TL;DR: In this article, the Kragujevac trees with a fixed degree and a fixed order, with maximal and minimal energy, were determined, and the order of the trees was given.
Journal ArticleDOI
On Generalized Distance Gaussian Estrada Index of Graphs
TL;DR: Some bounds are established for the generalized distance Gaussian Estrada index P α ( G) of a connected graph G, involving the different graph parameters, including the order n, the Wiener index W ( G ) , the transmission degrees and the parameter α ∈ [ 0, 1 ] , and characterize the extremal graphs attaining these bounds.
Journal ArticleDOI
Bounds for the Huckel energy of a graph
TL;DR: It is shown that equality holds in both upper bounds if and only if $G$ is a strongly regular graph with parameters $(n, k, \lambda, \mu) and an infinite family of these strongly regular graphs whose construction was communicated by Willem Haemers to us.
Journal ArticleDOI
On graphs with three or four distinct normalized Laplacian eigenvalues
Xueyi Huang,Qiongxiang Huang +1 more
TL;DR: In this article, the authors characterized all connected bipartite graphs with at least three distinct normalized Laplacian eigenvalues among which one is equal to 1, and determined all bipartitite graphs having at least one vertebrae.
Journal ArticleDOI
Gaussianization of the spectra of graphs and networks. Theory and applications
Alhanouf Ali Alhomaidhi,Alhanouf Ali Alhomaidhi,Fawzi Al-Thukair,Ernesto Estrada,Ernesto Estrada +4 more
TL;DR: In this article, a new matrix function based on the Gaussianization of the adjacency matrix of a graph is proposed, which gives more weight to a selected reference eigenvalue λ ref, which may be located in any region of the graph spectra.