DM
2008
13 years 4 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
DM
2008
13 years 4 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
DM
2008
13 years 4 months ago
2008
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
DM
2008
13 years 4 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
DM
2008
13 years 4 months ago
2008
DM
2008
13 years 4 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
DM
2008
13 years 4 months ago
2008
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S
DM
2008
13 years 4 months ago
2008
A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12
DM
2008
13 years 4 months ago
2008
A path bundle is a set of 2a paths in an n-cube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths form two s...
DM
2008
13 years 4 months ago
2008
Abstract. It is known that the weight enumerator of a self-dual doublyeven code in genus g = 1 can be uniquely written as an isobaric polynomial in certain homogeneous polynomials ...