DM
2008
13 years 4 months ago
2008
DM
2008
13 years 4 months ago
2008
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
DM
2008
13 years 4 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
DM
2008
13 years 4 months ago
2008
Let m 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1
DM
2008
13 years 4 months ago
2008
In this paper we study recurrences concerning the combinatorial sum n r m = kr (mod m) n k and the alternate sum kr (mod m)(-1)(k-r)/m n k , where m > 0, n 0 and r are integers....
DM
2008
13 years 4 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
DM
2008
13 years 4 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
DM
2008
13 years 4 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
DM
2008
13 years 4 months ago
2008
We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn , where c
DM
2008
13 years 4 months ago
2008