scispace - formally typeset
Open AccessBook

Spectra of graphs : theory and application

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

Extinction and positivity of the solutions of the heat equations with absorption on networks

TL;DR: In this article, a discrete version of the following semilinear heat equation with absorption was proposed, which is known as ω-heat equations with absorption on a network, and it was proved that the asymptotic behaviors of the solutions u(x,t) as t tends to +∞ strongly depend on the sign of q−1.
Journal ArticleDOI

Spectral analogues of Erd\H{o}s' and Moon-Moser's theorems on Hamilton cycles

Binlong Li, +1 more
- 14 Apr 2015 - 
TL;DR: In this paper, the spectral analogies of Erdős' and Moon-Moser's Hamilton cycles in balanced bipartite graphs are presented, and the maximum (signless Laplacian) spectral radius of graphs in the class of non-Hamiltonian graphs of order $n$ and minimum degree at least $k is determined.
Journal ArticleDOI

The rank of a graph after vertex addition

TL;DR: The problem of determining the exact effect of adding a single vertex to a graph is more difficult, since the number of edges that can be added with this vertex is variable as mentioned in this paper.
Journal ArticleDOI

Some results on the index of unicyclic graphs

TL;DR: In this paper, the authors identify in some classes of unicyclic graphs (of fixed order and girth) those graphs whose index, i.e., the largest eigenvalue, is maximal.
Journal ArticleDOI

“Crowns”, and aromatic sextets in primitive coronoid hydrocarbons

TL;DR: In this article, a type of graphs derived from a cycle and associated with primitive coronoids are referred to as "crowns" and the characteristic polynomials of crowns are studied.