Open AccessBook
Spectra of graphs : theory and application
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
Posted Content
Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth
Andreas Krebs,Oleg Verbitsky +1 more
TL;DR: In this article, a bisimulation version of the Immerman-Lander 2-pebble counting game is used to show that color refinement, the classical procedure used in isomorphism testing and other areas for computing the coarsest equitable partition of a graph, needs 2-o(1))n$ rounds to achieve color stabilization on each of the disjoint union of two connected graphs.
Journal ArticleDOI
Laplacian eigenvalues of the second power of a graph
Kinkar Chandra Das,Ji-Ming Guo +1 more
TL;DR: Borders are given on the first two largest Laplacian eigenvalues of the second power of a general graph, and on the secondPower of a tree.
Journal ArticleDOI
Two upper bounds for the degree distances of four sums of graphs
TL;DR: In this paper, the degree distance of a connected graph G is defined as vertex-degree-weighted sum of the============ distances, that is, DD(G) = Σ{u,v}V(G)[dG(u)+dG (v)]d[u,V|G], where dG(U)============ denotes the degree of a vertex u in G and dG (U,v|G) denotes the distance====== between two vertices u and v in G.