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
The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
TL;DR: In this article, the effects on the signless Laplacian spectral radius of a graph when some operations, such as edge moving, edge subdividing, are applied to the graph are studied.
Journal ArticleDOI
The spectral moments of trees with given maximum degree
TL;DR: This work shows that all Δ -trees come before all trees in T n, Δ ∖ T n , Δ ∗ in an S -order and presents a criterion for a Δ -tree coming before another Δ - tree in anS -order.
Journal ArticleDOI
New upper bounds for Estrada index of bipartite graphs
TL;DR: In this paper, the Estrada index of bipartite graphs was shown to be upper bounded by a (4, 6 ) -fullerene, and this bound was later improved to (4, 6 ) by the authors.
Journal ArticleDOI
Graphs with few distinct distance eigenvalues irrespective of the diameters
Fouzul Atik,Pratima Panigrahi +1 more
TL;DR: In this article, the authors constructed a class of graphs with arbitrary diameter and satisfying the property that the distance matrix of each graph in the families has exactly k distinct eigenvalues.