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
Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds
TL;DR: This paper focuses on the eigenvector techniques for getting some (lower and upper) bounds on the Q-index of nested split graphs and gives some computational results in order to compare these bounds.
Journal ArticleDOI
Computing and interpreting the adjacency spectrum of traffic networks
TL;DR: It is investigated whether certain structural properties of a traffic network can be identified by an analysis of the spectrum of its adjacency matrix by analysing the values of the RSPs in the matrix.
DissertationDOI
Cospectral bipartite graphs for the normalized Laplacian
TL;DR: In this article, the authors construct infinite families of trees that are pairwise cospectral with respect to the normalized Laplacian, and use this constructions to construct new constructions of cospectrals pairs of bipartite unweighted graphs.
Journal ArticleDOI
On integral graphs which belong to the class αKa∪βKb,b
TL;DR: This work establishes a characterization of integral graphs which belong to the class αK a ∪βK b,b , where mG denotes the m-fold union of the graph G.
Journal ArticleDOI
Cospectrality of complete bipartite graphs
TL;DR: In this paper, the authors studied the cospectrality of complete bipartite graphs by the Euclidian distance and showed that for all positive integers m and n there are some positive integers r, s and a non-negative integer t such that, where is the complete bip-artite graph with parts of sizes m, n.