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
Generalizing double graphs
TL;DR: In this article, the authors study the graphs which are direct product of a simple graph G with the graphs obtained by the complete graph Kk adding a loop to each vertex; thus these graphs turn out to be a generalization of the double graphs.
Journal ArticleDOI
On bicyclic reflexive graphs
TL;DR: This work uses graph modifications involving Smith trees to construct four classes of maximal bicyclic reflexive graphs, said to be reflexive if the second largest eigenvalue of a (0,1)-adjacency matrix does not exceed 2.
Journal ArticleDOI
Recent Progress in Some Active Topics on Complex Networks
TL;DR: By combining the results of different research orientations, a review of the recent advances in regards to spectral graph theory, opinion dynamics, interdependent networks, graph energy theory and temporal networks is provided.
Journal ArticleDOI
Optimizing synchronizability in networks of coupled systems
TL;DR: Two solution methods, namely the concave–convex fractional programming and the Semidefinite Programming (SDP) formulations of the problem have been provided and the proposed solution methods have been compared over different topologies and branches of an arbitrary network, where the SDP based approach has shown to be less restricted and more suitable for a wider range of topologies.
Journal ArticleDOI
The leaf-free graphs with nullity 2c(G)−1
TL;DR: This paper completely characterize all leaf-free graphs with nullity one less than the above upper bound, i.e., η ( G) = 2 c ( G ) − 1 .