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
Integral trees and integral graphs
TL;DR: In this article, a monograph dealing with integral graphs, Laplacian integral regular graphs, cospectral graphs, integral regular graph, and Cospectral integral graphs is presented.
Journal Article
Two Classes of Integral Regular Graphs.
Ligong Wang,Xueliang Li,C. Hoede +2 more
TL;DR: The spectra and characteristic polynomials of Kn,n+1 ≡ Kn+1,n and K1,p[(p − 1)Kp] are given from the theory on matrices and the numbers of spanning trees for such graphs are obtained.
Journal ArticleDOI
On Q-integral (3,s)-semiregular bipartite graphs
Slobodan K. Simić,Zoran Stanić +1 more
TL;DR: In this article, the signless Laplacians of semiregular bipartite graphs with integral signless L 1 −integral spectrum were investigated. But the authors only considered the case where the graph has a signless spectrum composed of integers.
Journal ArticleDOI
Chromatic invariants for finite graphs: Theme and polynomial variations
TL;DR: In this paper, generalized chromatic invariants are obtained by counting morphisms from X to the q th graph of a given sequence Y ∗ = (Y q ) q ⩾1.
Proceedings ArticleDOI
Layout indexing of trademark images
TL;DR: This paper proposes a framework in which a graph-based indexing schema will be applied to facilitate efficient trademark retrieval based on spatial relations between image components, regardless of mutual shape similarity.