Loading...

Go to the content (press return)

- Author
- Fiol, M.
- Type of activity
- Presentation of work at congresses
- Name of edition
- The 16th GraphMasters Workshop
- Date of publication
- 2018
- Presentation's date
- 2018-11-29
- Abstract
- As it is well known, from the (adjacency or Laplacian) spectrum of a graph we can infer some properties about its combinatorial structure. Some examples are the diameter of the graph, its independence number, some distance-regularity properties, etc. In order to derive such results, different families of polynomials, obtained from the spectrum, have shown to be very useful. In this talk, we aim to present some of these families, together with their applications.
- Keywords
- Graph, diameter, distance-regularity, k-independence number, polynomials, spectrum
- Group of research
- COMBGRAPH - Combinatorics, Graph Theory and Applications

- Fiol Mora, Miquel Àngel (author and speaker )