Recent Submissions

  • Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues 

    Fiol Mora, Miquel Àngel; Brouwer, Andries (Elsevier, 2015)
    Article
    Restricted access - publisher's policy
    Let the Kneser graph K of a distance-regular graph $\Gamma$ be the graph on the same vertex set as $\Gamma$, where two vertices are adjacent when they have maximal distance in $\Gamma$. We study the situation where the ...
  • Almost every tree with m edges decomposes K2m,2m 

    Drmota, Michael; Lladó Sánchez, Ana M. (2014-01)
    Article
    Open Access
    We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K2m,2m, a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost ...
  • Classification of numerical 3-semigroups by means of L-shapes 

    Aguiló Gost, Francisco de Asis L.; Marijuan López, Carlos (2014-06-01)
    Article
    Open Access
    We recall L-shapes, which are minimal distance diagrams, related to weighted 2-Cayley digraphs, and we give the number and the relation between minimal distance diagrams related to the same digraph. On the other hand, we ...
  • On global location-domination in bipartite graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-06-10)
    External research report
    Open Access
  • On global location-domination in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-05-29)
    Article
    Open Access
    A dominating set S of a graph G is called locating-dominating, 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 ...
  • Oxidative stress is a central target for physical exercise neuroprotection against pathological brain aging 

    Garcia-Mesa, Yoelvis; Colie, Sandra; Corpas, Ruben; Cristofol, Rosa; Comellas Padró, Francesc de Paula; Nebreda, Angel; Giménez-Llort, Lydia; Sanfeliu, Coral (2015-02-26)
    Article
    Restricted access - publisher's policy
    Physical exercise is suggested for preventing or delaying senescence and Alzheimer’s disease (AD). We have examined its therapeutic value in the advanced stage of AD-like pathology in 3xTg-AD female mice through voluntary ...
  • 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 ...
  • A new application of the $\otimes_h$-product to $\alpha$-labelings 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2015)
    Article
    Open Access
    The weak tensor product was introduced by Snevily as a way to construct new graphs that admit a-labelings from a pair of known a-graphs. In this article, we show that this product and the application to a-labelings can be ...
  • 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 ...

View more