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
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
On the algebraic theory of pseudo-distance-regularity around a set☆
Miguel Angel Fiol,E. Garriga +1 more
TL;DR: The concept of pseudo-distance-regularity was introduced in this paper, which is based on giving each vertex u ∈ V a weight which equals the corresponding entry ν u of ν and regularizes the graph.
Journal ArticleDOI
On unimodular graphs
Saieed Akbari,Steve Kirkland +1 more
TL;DR: For bipartite graphs having a unique perfect matching, this article provided a formula for the inverse of the corresponding adjacency matrix, and addressed the problem of when that inverse is diagonally similar to a nonnegative matrix.
Book ChapterDOI
Graph Polynomials and Their Applications II: Interrelations and Interpretations
TL;DR: This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining agraph polynomial and then for decoding the combinatorial information it contains.
Equienergetic bipartite graphs
Yaoping Hou,Lixin Xu +1 more
TL;DR: In this article, the authors show how inflnitely many pairs of equienergetic bipartite graphs can be constructed, such that these bipartitite graphs are connected, possess equal number of vertices and edges, and are not cospectral.