Applications of Graph Spectra in Computer Science

Jul 16 2012 - 10:28
Jul 20 2012 - 10:28

Centre de Recerca Matemàtica, Bellaterra, Barcelona

Short description of the event: 

In graph theory, the spectra of matrices associated with a graph are widely used to characterize its properties and to extract structural information. There are several graph matrix representations such as the adjacency matrix, combinatorial Laplacian, normalized Laplacian and signless Laplacian. Spectral graph theory has also many applications in other scientific fields such as chemistry, theoretical physics, and quantum mechanics. The aim of this workshop is to foster the connections between spectral graph theory and computer science.

Dragan Stevanovic (chair), University of Primorska, Koper, Slovenia and University of Nis
Robert Elsässer, University of Paderborn, Institute for Computer Science
Francesc Comellas, UPC, Barcelona
Vladimir Nikiforov, University of Memphis, Department of Mathematical Sciences
Nair Maria Maia de Abreu, Federal University of Rio de Janeiro, Graduate School and Research in Engineering
Fan Chung Graham, University of California at San Diego
Piet F.A. Van Mieghem, Delft University of Technology
Dragos Cvetkovic, Mathematical Institute, Serbian Academy of Science and Arts
Miquel Àngel Fiol, UPC, Barcelona
Maria José Serna, UPC, Barcelona
Dieter Mitsche, UPC, Barcelona
Steve Kirkland, Hamilton Institute, NUI Maynooth

Selected papers will be published in a special issue of Discrete Applied Mathematics devoted to this conference. The issue is also open for papers not presented at the conference, but in line with conference theme. Deadline for submission to the special issue is November 15, 2012. The guest editors are: Francesc Comellas, Robert Elsasser and Dragan Stevanovic