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
Proceedings ArticleDOI
Analysis of accelerated gossip algorithms
TL;DR: This paper investigates accelerated gossip algorithms for distributed computations in networks where shift-registers are utilized at each node and proves the existence of the desired acceleration and establishes the fastest rate of convergence in expectation for two-register symmetric gossip.
Journal ArticleDOI
Defensive k-alliances in graphs
TL;DR: The defensive kk-alliance number of GG, denoted by ak(G)ak(G), is defined as the minimum cardinality of a defensive kK-alliances in GG.
Journal ArticleDOI
Double graphs
TL;DR: The elementary properties of double graphs are studied, i.e. of graphs which are the direct product of a simple graph G with the graph obtained by the complete graph K"2 adding a loop to each vertex.
Journal ArticleDOI
An Eigenvalue Characterization of Antipodal Distance-Regular Graphs
TL;DR: It is shown that is an r-antipodal distanceregular graph if and only if the distance graph d is constituted by disjoint copies of the complete graph Kr, with r satisfying an expression in terms of n and the distinct eigenvalues.
Journal ArticleDOI
Families of Line-Graphs and Their Quantization
TL;DR: In this article, it was shown that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family Ln(G).