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
Dissertation
Synchronization of Chaotic Optoelectronic Oscillators: Adaptive Techniques and the Design of Optimal Networks
TL;DR: It is found that the convergence rate is maximized for certain network configurations, called optimal networks, which are identified based on the eigenvalues of the coupling matrix, and a classification system is introduced that categorizes networks according to their sensitivity to coupling perturbations as sensitive and nonsensitive configurations.
The Spectral Moments and Energy of Graphs
TL;DR: In this article, an upper bound for the energy of a graph that involves its moments is obtained, where the moments are defined as the sum of the absolute values of its eigenvalues.
Book ChapterDOI
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes
Tom Høholdt,Heeralal Janwal +1 more
TL;DR: It is shown that the bipartite graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs, which leads to a theoretical explanation of the good performance of a class of LDPC codes.
Journal ArticleDOI
Construction of characteristic polynomial of reciprocal graphs from the number of pendant vertices
TL;DR: In this article, a method for construction of the characteristic polynomial coefficients of the three classes of reciprocal graphs, viz., Ln + n(p), Cn+n(p) and K1,n−1 + n (p), has been developed that requires only the value of n.
Journal ArticleDOI
The ordering of unicyclic graphs with the smallest algebraic connectivity
TL;DR: The second and the third smallest algebraic connectivity among all unicyclic graphs with n(n>=12) vertices are determined.