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
Main Eigenvalues of Real Symmetric Matrices with Application to Signed Graphs
TL;DR: The main eigenvalue of a real symmetric matrix is called main if there is an associated eigenvector not orthogonal to the all-1 vector j as mentioned in this paper.
Journal ArticleDOI
Maximal reflexive cacti with four cycles: The approach via Smith graphs
TL;DR: In this paper, the authors show that the presence of Smith trees is evident in all maximal reflexive cacti with four cycles and that in most of them Smith graphs appear in the described way.
Journal ArticleDOI
Application of some graph invariants to the analysis of multiprocessor interconnection networks
TL;DR: In this paper, it was shown that the number of connected graphs with a bounded tightness is finite and that the tightness of the second type is a relevant graph invariant.
Journal ArticleDOI
D-optimal weighing designs for n≡−1mod4 objects and a large number of weighings
TL;DR: In this paper, it was shown that the problem of finding a trace-minimal regular graph is equivalent to finding a regular graph whose degree of regularity and number of vertices depend only on n and r, with a certain traceminimal property.
Journal ArticleDOI
Perfect 2-Colorings of Transitive Cubic Graphs
TL;DR: For all transitive cubic graphs with at most 18 vertices, the authors obtained a complete description for the admissible parameters of perfect 2-colorings, and showed that perfect 2 colorings are admissible for transitive 3-coloring graphs.