scispace - formally typeset
Open AccessBook

Spectra of graphs : theory and application

Dragoš Cvetković, +2 more
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
Posted Content

On the ordering of trees by the Laplacian coefficients

Aleksandar Ili ' c
- 21 Apr 2011 - 
TL;DR: In this article, Chen et al. generalize the results from [X.-D. Zhang, X.-P. Lv, Y.-H. Chen, and X.-M. Zhang on the partial ordering of trees with given diameter.
Journal ArticleDOI

Maximizing Algebraic Connectivity via Minimum Degree and Maximum Distance

Gang Li, +3 more
- 18 Jul 2018 - 
TL;DR: A heuristic algorithm is presented, the minimum degree and maximum distance algorithm, based on the analysis of the Fiedler vector, which does not need to compute the algebraic connectivity and can be applied to very large networks, especially to large sparse networks.
Journal Article

Estrada index of acyclic molecules

Ivan Gutman, +4 more
- 01 May 2007 - 
TL;DR: In this article, a structure-descriptor EE, recently proposed by Estrada, was examined in the case of trees with n vertices and the main structural factor influencing the differences between the EE-values was found to be the Zagreb index Zg.
Journal ArticleDOI

Graphs with the maximal Estrada indices

Wen-Huan Wang, +1 more
- 01 Apr 2014 - 
TL;DR: In this paper, two new transformations are proposed to compare the Estrada indices between two graphs, where n and m are the numbers of vertices and edges, respectively, respectively.
Journal ArticleDOI

Further analysis of the number of spanning trees in circulant graphs

Talip Atajan, +2 more
- 01 Nov 2006 - 
TL;DR: Let 1 s1