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
Uniquely Discriminating Molecular Structures Using Novel Eigenvalue-Based Descriptors
TL;DR: In this paper, five families of spectra-based descriptors based on the eigenvalues of certain molecular matrices representing chemical structures were proposed to discriminate real and synthetic molecular graphs.
Journal ArticleDOI
Being Central Is a Double-Edged Sword: Knowledge Network Centrality and New Product Development in U.S. Pharmaceutical Industry
John Qi Dong,Chia-Han Yang +1 more
TL;DR: In this paper, the authors empirically examined the impacts of three measures for knowledge network centrality (i.e., degree centrality, closeness centrality and eigenvector centrality) on NPD performance.
Journal ArticleDOI
Spectral properties of geometric-arithmetic index
TL;DR: A GA Laplacian matrix is defined which determines the geometric-arithmetic index of a graph and satisfies properties similar to the ones of the classical LaplACian matrix.
Journal ArticleDOI
Bounding the largest eigenvalue of trees in terms of the largest vertex degree
TL;DR: In this article, it was shown that λ 1(G) is the largest eigenvalue of the adjacency matrix of a graph G and λ 2(G), λ 3 (G) denotes the largest value of the Laplacian matrix of G.
Journal ArticleDOI
The lollipop graph is determined by its Q-spectrum
TL;DR: It is proved that all lollipop graphs are determined by their Q-spectrum, that is, any graph having the same spectrum as G is isomorphic to G.