Sciweavers

547 search results - page 51 / 110
» dm 2008
Sort
View
DM
2006
108views more  DM 2006»
15 years 1 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
79
Voted
DM
2006
54views more  DM 2006»
15 years 1 months ago
A note on interconnecting matchings in graphs
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Tomás Kaiser
87
Voted
DM
2006
84views more  DM 2006»
15 years 1 months ago
Hamilton cycles in digraphs of unitary matrices
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
Gregory Gutin, Arash Rafiey, Simone Severini, Ande...
DM
2006
68views more  DM 2006»
15 years 1 months ago
A note on maximally repeated sub-patterns of a point set
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...
86
Voted
DM
2006
92views more  DM 2006»
15 years 1 months ago
Sums of powers of the degrees of a graph
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
Sebastian M. Cioaba