### Recent Submissions

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

(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 ﻿

(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 ﻿

(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 graphs ﻿

(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 ﻿

(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 ...
• #### A new application of the $\otimes_h$-product to $\alpha$-labelings ﻿

(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 ...
• #### Some results on the structure of multipoles in the study of snarks ﻿

(2015-02-25)
Article
Open Access
Multipoles are the pieces we obtain by cutting some edges of a cubic graph in one or more points. As a result of the cut, a multipole M has vertices attached to a dangling edge with one free end, and isolated edges with ...
• #### Magic coverings and the Kronecker product ﻿

(2014-11-01)
Article
Restricted access - publisher's policy
In this paper we study a relationship existing among (super) magic coverings and the well known Kronecker product of matrices. We also introduce the concept of Z(n)-property for digraphs in order to study this relation ...
• #### Linearly dependent vectorial decomposition of clutters ﻿

(2014-09-16)
Article
Open Access
This paper deals with the question of completing a monotone increasing family of subsets of a finite set to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...
• #### Preface special issue: Graph Spectra in Computer Science ﻿

(2014-10-30)
Article
Open Access
Preface to the special issue of Discrete Applied Mathematics with title