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
Journal ArticleDOI
Energy, Laplacian energy of double graphs and new families of equienergetic graphs
TL;DR: In this article, the energy and Laplacian energy of the k-th iterated extended double cover of a bipartite graph G and a double graph D(G) were studied.
Journal ArticleDOI
Characteristic, admittance and matching polynomials of an antiregular graph
TL;DR: In this article, the characteristic polynomial, the admittance (or Laplacian) polynomials and the matching polynomorphism of a connected antiregular graph are studied.
Journal ArticleDOI
A new spectral method for nodal ordering of regular space structures
Ali Kaveh,Hossein Rahami +1 more
TL;DR: In this article, an efficient method for calculating the eigenvalues of space structures with regular topologies is presented, where the topology of a structure is formed as the Cartesian product of its generators.
Journal ArticleDOI
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
TL;DR: In this paper, a survey of known results about the spectra of the adjacency, Laplacian and signless L 1 matrix of graphs resulting from various graph operations is presented.
Posted Content
Uniform random spanning trees
TL;DR: This article addresses the question about spanning trees most natural to anyone in probability theory, namely what does a typical spanning tree look like?