arXiv Analytics

Sign in

arXiv:1301.1521 [math.CO]AbstractReferencesReviewsResources

On the excessive [m]-index of a tree

Giuseppe Mazzuoccolo

Published 2013-01-08, updated 2013-06-05Version 2

The excessive [m]-index of a graph G is the minimum number of matchings of size m needed to cover the edge-set of G. We call a graph G [m]-coverable if its excessive [m]-index is finite. Obviously the excessive [1]-index is |E(G)| for all graphs and it is an easy task the computation of the excessive [2]-index for a [2]-coverable graph. The case m=3 is completely solved by Cariolaro and Fu in 2009. In this paper we prove a general formula to compute the excessive [4]-index of a tree and we conjecture a possible generalization for any value of m. Furthermore, we prove that such a formula does not work for the excessive [4]-index of an arbitrary graph.

Comments: 12 pages, 7 figures, to appear in Discrete Applied Mathematics
Categories: math.CO
Subjects: 05C70, 05C15
Related articles: Most relevant | Search more
arXiv:math/0009230 [math.CO] (Published 2000-09-26)
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
arXiv:math/0209020 [math.CO] (Published 2002-09-03)
Computation in Coxeter groups II. Minimal roots
arXiv:math/9811108 [math.CO] (Published 1998-11-18, updated 1998-11-19)
Proof of a Conjecture of Chan, Robbins, and Yuen

Links

Toolbox