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
A systematic procedure for type synthesis of mechanisms with literature review literaturbe-sprechung
TL;DR: A systematic procedure for type synthesis, suitable for computer implementation, is introduced and the large body of literature pertaining to type synthesis is discussed in the context of the proposed procedure.
Journal ArticleDOI
Maximum k-regular induced subgraphs
TL;DR: It is proved that finding a maximum cardinality k-regular induced subgraph is an NP-hard problem for any fixed value of k, and a convex quadratic upper bound on the size of a k- regular induced sub graph is proposed.
Journal ArticleDOI
On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
Jinshan Xie,Jinshan Xie,An Chang +2 more
TL;DR: In this paper, the adjacency matrices for graphs are generalized to uniform hypergraphs, and some fundamental properties for the adjACency tensor and its Z-eigenvalues of a uniform hyper graph are obtained.
Journal ArticleDOI
Entropy and the clique polynomial
TL;DR: In this article, a sharp lower bound on the spectral radius (A) of a reciprocal Perron{Frobenius matrix A 2 M2g(Z) was shown.
Journal ArticleDOI
On graphs whose second largest eigenvalue does not exceed 5 -1 / 2
TL;DR: This paper studies the structure of graphs whose second largest eigenvalue does not exceed (√5−1) and characterized in Cao and Yuan (1993).