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
Some new lower bounds for energy of graphs
TL;DR: Some new lower bounds for energy of non-singular graphs, connected non- Singular graphs and connected unicyclic non-Singular graphs in terms of number of vertices, number of edges, maximum degree and Zagreb indices are presented.
Posted Content
A Graph Partitioning Approach to Predict Patterns in Lateral Inhibition Systems
TL;DR: Results from monotone systems theory are used to prove the existence of patterns that are structured in such a way that all the cells in the same class have the same final fate.
Proceedings ArticleDOI
Gluing Kuramoto coupled oscillators networks
Eduardo Canale,Pablo Monzon +1 more
TL;DR: This work proves that the problem of almost global synchronization of the Kuramoto model of sinusoidally symmetric coupled oscillators with a given topology could be reduced to the analysis of the blocks of the underlying interconnection graph.
Journal ArticleDOI
Universal adjacency matrices with two eigenvalues
TL;DR: A universal adjacency matrix as discussed by the authors is a generalization of the Laplacian, the signless and the Seidel matrices, and it is defined as a matrix in Span { A, D, I, J } with a nonzero coefficient for A, where D = diag (d 1, …, d n ) and I and J are the n × n identity and all-ones matrix, respectively.
Journal ArticleDOI
On the third largest Laplacian eigenvalue of a graph
TL;DR: In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the 3rd largest degree of the graph.