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 evaluation of the eighth moment for benzenoid graphs
TL;DR: In this paper, the evaluation of the 8 moment of the adjacency matrix of benzenoid graphs is considered and it is found that the 8 moments can be expressed in terms of 7 graphical invariants.
Distance Laplacian eigenvalues and chromatic number in graphs
Mustapha Aouchiche,Pierre Hansen +1 more
TL;DR: In this paper, the authors studied the spectral radius of the distance Laplacian of a connected graph with fixed order and chromatic number and proved lower bounds on the spectral spectral radius in terms of $n$ and $chi.
Journal ArticleDOI
Comparing energy and randić energy
Boris Furtula,Ivan Gutman +1 more
TL;DR: In this article, the Randic energy (RE) was examined and its relation to the total π-electron energy (E ) was investigated, and the structure of the connected graph with a fixed number of vertices and maximal RE value was established.
Journal ArticleDOI
Constructing cospectral signed graphs
TL;DR: In this paper, the Godsil-McKay algorithm was ported to signed graphs, and it was shown that with suitable adaption, such algorithms can be successfully ported to cospectral switching nonisomorphic signed graphs.
Posted Content
Spectra of infinite graphs with tails
TL;DR: In this article, a canonical form of the adjacency matrix of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs is given, and a complete answer is given in the case when the number of attached paths to each vertex is the same.