# Discrete Mathematics

Discrete Mathematics > 1998 > 186 > 1-3 > 145-155

Discrete Mathematics > 1999 > 197-198 > 415-429

_{r}(G), is the minimum cardinality of a restrained dominating set of G. Domke et al., submitted showed that if a connected graph G of order n has minimum degree at least 2 and is not one of...

Discrete Mathematics > 2002 > 250 > 1-3 > 93-107

Discrete Mathematics > 2002 > 254 > 1-3 > 175-189

_{k}such that given any subset U of k vertices of G, there exists a dominating set of G of cardinality at most d

_{k}containing U. Hence, the k-restricted domination number of a graph G measures how many vertices are necessary to dominate a graph if an arbitrary set of k vertices must be included in the dominating...

Discrete Mathematics > 2004 > 277 > 1-3 > 15-28

_{m}

_{,}

_{n}was introduced by the first and last authors and G. Nebe in a previous paper. In the present work, we give a general lower bound for the size of such designs. The method is inspired by Delsarte, Goethals and Seidel work in the case of spherical designs. This leads us to introduce a notion of f-code in Grassmannian spaces, for which...

Discrete Mathematics > 2004 > 278 > 1-3 > 109-125

Discrete Mathematics > 2004 > 285 > 1-3 > 7-15

Discrete Mathematics > 2004 > 286 > 3 > 255-261

Discrete Mathematics > 2004 > 289 > 1-3 > 25-44

Discrete Mathematics > 2005 > 301 > 2-3 > 175-194

Discrete Mathematics > 2005 > 302 > 1-3 > 211-224

Discrete Mathematics > 2005 > 305 > 1-3 > 18-32

Discrete Mathematics > 2006 > 306 > 16 > 1959-1964

Discrete Mathematics > 2006 > 306 > 18 > 2229-2233

Discrete Mathematics > 2007 > 307 > 1 > 18-37

Discrete Mathematics > 2007 > 307 > 11-12 > 1356-1366

Discrete Mathematics > 2007 > 307 > 17-18 > 2315-2321

Discrete Mathematics > 2007 > 307 > 21 > 2453-2463

Discrete Mathematics > 2007 > 307 > 21 > 2514-2524

Discrete Mathematics > 2008 > 308 > 10 > 1909-1920