scispace - formally typeset
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

The Block-Polynomials and Block-Spectra of Dendrimers #

TL;DR: In this article, a block construction of dendrimers is simulated with block polynomials, which allow the study of their roots, i.e., their spectrum of eigenvalues.
Journal ArticleDOI

Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra

TL;DR: An upper bound for the cardinality of k (u) is derived, showing that j k (U)j decreases at least as O( 2 ), and the cases in which the bound is attained are characterized.
Journal ArticleDOI

Spectral characterizations of sandglass graphs

TL;DR: It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra.
Journal ArticleDOI

Energy of Graphs, Matroids and Fibonacci Numbers

TL;DR: In this paper, it was shown that generalized generalized Fibonacci constants ϕn (n ≥ 2) cannot be the energy of graphs and all natural powers of ϕ2n cannot be energy of a matroid.
Journal ArticleDOI

Graphs with a Small Number of Nonnegative Eigenvalues

TL;DR: By means of computer checking, all simple graphs with at most two nonnegative eigenvalues are determined, and all minimalsimple graphs with exactly two (respectively, three) non negative eigen values are determined.