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
Spectral distances on graphs
Jiao Gu,Bobo Hua,Shiping Liu +2 more
TL;DR: It is proved that the diameter of the set of graphs, as a pseudo-metric space equipped with d 1, is one and the behavior of d 1 when the size of graphs tends to infinity is studied by interlacing inequalities aiming at exploring large real networks.
Posted Content
On laplacian like energy of trees
TL;DR: In this paper, the Laplacian-like energy of a graph is defined as the sum of square roots of its eigenvalues, which coincides with the incidence energy of the graph.
Journal ArticleDOI
Polaritons and excitons: Hamiltonian design for enhanced coherence.
TL;DR: The key result of this report is that, for some classes of Hamiltonian matrix structure, coherent delocalization is not easily defeated by energy disorder, even when the electronic coupling is small compared to disorder.
Journal ArticleDOI
On the Laplacian energy of a graph
TL;DR: In this paper, the authors consider the energy of a simple graph with respect to its Laplacian eigenvalues and prove some basic properties of this energy, including the minimal value of the energy in the class of all connected graphs on n vertices (n = 1, 2,...).
Journal ArticleDOI
Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
TL;DR: Gutman and Vidovic as mentioned in this paper proved that the maximal energy of a bipartite bicyclic graph is P n 6, 6, where n is the number of vertices in the graph.