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...
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...
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...
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,...
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. ...