Recent Submissions

  • Decomposing almost complete graphs by random trees 

    Lladó Sánchez, Ana M. (2014)
    Conference report
    Restricted access - publisher's policy
    An old conjecture of Ringel states that every tree with m edges decom- poses the complete graph K 2 m +1 . A more general version of the Ringel’s conjecture says that every tree with m edges decomposes K rm +1 for each r ...
  • Caracterizaciones combinatorias y algebraicas de grafos distancia-regulares 

    Fiol Mora, Miquel Àngel (Universitat Rovira i Virgili, 2014)
    Conference report
    Open Access
    Los grafos distancia-regulares aparecen a menudo en el estudio de es- tructuras matemáticas con un alto grado de simetría y/o regularidad. Un ejemplo bien conocido de tales grafos son los esqueletos ...
  • An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs 

    Abiad, Aida; Fiol Mora, Miquel Àngel; Haemers, Willem H.; Perarnau Llobet, Guillem (2014)
    Conference report
    Open Access
    We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by ...
  • Linearly dependent vectorial decomposition of clutters 

    Martí Farré, Jaume (2014)
    Conference report
    Open Access
    This paper deals with the question of completing a monotone increas- ing family of subsets G of a finite set ¿ to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...
  • Formación interdisciplinar de educación para el desarrollo dirigida a docentes de titulaciones científico-técnicas en un entorno virtual de aprendizaje 

    Pérez Mansilla, Sonia; BONI, A; Pérez Foguet, Agustí (4rt Congrés Internacional Docència Universitària i Innovació, 2004)
    Conference report
    Open Access
    Desde 2001, ISF se ha planteado como estrateg ia prioritaria para la promoción de la educación para el desarrollo en la universi dad, la formación del profesorado de carreras científico-técnicas. El objeti vo general ...
  • On perfect and quasiperfect dominations in graphs 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2014)
    Conference report
    Open Access
  • LD-graphs and global location-domination in bipartite graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
    Conference report
    Open Access
    A dominating setS of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
  • The graph distance game and some graph operations 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2014)
    Conference report
    Open Access
    In the graph distance game, two players alternate in constructing a max- imal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to ...
  • The degree-diameter problem in maximal bipartite planar graphs 

    Dalfó Simó, Cristina; Huemer, Clemens; Salas, Julian (2014)
    Conference lecture
    Open Access
    The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree and diameter D. We consider the (A ,D) problem for maximal planar bipartite ...
  • The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral diameter 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2013)
    Conference lecture
    Open Access
    We study the (D;D) and (D;N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by changing ...

View more