The research of COMBGRAPH deals with extremal problems in Combinatorics and Graph Theory. The study of discrete configurations (which optimize one or several parameters) is a main source of challenges. This project includes problems related to: the optimization of metric parameters of graphs, coloring and labeling problems, connectivity and reliability, configurations in graphs, symmetric structures, tilings, algorithm design, and signal processing techniques. All these problems are mainly motivated by applications in network design, analysis for communication protocols, multiprocessor systems, and complex networks. We use combinatorial and algebraic techniques in graph theory, Fourier analysis and polynomial and probabilistic methods in combinatorics, together with techniques close to the combinatorial nature of the problems under consideration. This project gathers the activity of a well-established research group with almost 30 years of experience and with international projection.
Cáceres, J.; Puertas, M. Luz; Hernando, M.; Mora, M.; Pelayo, I. M. Electronic notes in discrete mathematics Vol. 46, p. 153-159 DOI: 10.1016/j.endm.2014.08.021 Date of publication: 2014-09-02 Journal article
Pelayo, I. M.; Cáceres, José; Hernando, M.; Mora, M.; Puertas, M. Luz International Colloquium on Graph Theory and Combinatorics p. 17-18 Presentation's date: 2014-06-30 Presentation of work at congresses
López, S.C.; Muntaner-Batle, F.A.; Rius, M. Canadian mathematical bulletin. Bulletin canadien de mathématiques Vol. 57, num. 2, p. 375-380 DOI: 10.4153/CMB-2013-036-1 Date of publication: 2014-06-01 Journal article