Loading...
Loading...

Go to the content (press return)

Equivalent characterizations of the spectra of graphs and some applications

Author
Diego, V.; Fàbrega, J.; Fiol, M.
Type of activity
Presentation of work at congresses
Name of edition
International Workshop on Combinatorial and Computational Aspects of Optimization, Topology and Algebra
Date of publication
2016
Presentation's date
2016-12-01
Book of congress proceedings
International Workshop on Combinatorial and Computational Aspects of Optimization, Topology and Algebra (ACCOTA 2016): Los Cabos, Baja California, Mexico: November 27 to December 3, 2016
First page
15
Last page
15
Repository
https://arxiv.org/abs/1608.00091 Open in new window
URL
http://www.math.cinvestav.mx/accota2016/ Open in new window
Abstract
As it is well known, the spectrum sp G (of the adjacency matrix A) of a graph G, with d distinct eigenvalues other than its spectral radius ¿0, usually provides a lot of information about the structure of G. Moreover, from sp G we can define the so-called predistance polynomials p0, . . . , pd ¿ Rd[x], with dgr pi = i, i = 0, . . . , d, which are orthogonal with respect to the scalar product hf, giG = 1 n tr(f(A)g(A)) and normalized in such a way that kpik 2 G = pi(¿0). They can be seen as a ...
Keywords
graph, predistance polynomials, preintersection numbers, spectrum
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants