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
Proceedings ArticleDOI
CLIPPER: A Graph-Theoretic Framework for Robust Data Association
TL;DR: CLIPPER as discussed by the authors uses a relaxation of the combinatorial problem and returns solutions that are guaranteed to correspond to the optima of the original problem, achieved with an efficient projected gradient ascent approach.
Journal ArticleDOI
Polynomial reconstruction of signed graphs
Slobodan K. Simić,Zoran Stanić +1 more
TL;DR: In this article, the reconstruction problem of the characteristic polynomial of graphs from their polynomials was studied for graphs of order n > 2, and besides some general results, it was shown that the problem can be resolved within signed trees and unicyclic signed graphs, and also within disconnected signed graphs.
Journal Article
On the spectral characterization of theta graphs
TL;DR: In this article, it was shown that the adjacency spectrum of theta-graphs containing odd cycles and without no 4-cycles is sufficient to determine the theta(i,j,k) with minimal spectral radius.
Journal ArticleDOI
Randić index and lexicographic order
Oswaldo Araujo,Juan Rada +1 more
TL;DR: In this paper, it was shown that the Randic index is monotone increasing over a well-ordered sequence of trees with unique branched vertices, where the degree of each vertex is determined by the number of vertices in the tree.
Journal ArticleDOI
Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
TL;DR: In this article, the authors resolve conjectures of AutoGraphiX relating the index and the matching number of connected graphs, and show that these conjectures are not correct and propose a new index index for connected graphs.