This paper proves several non-trivial upper bounds for $rc(G)$, as well as determine sufficient conditions that guarantee that if $G$ is a connected graph with $n$ vertices and with minimum degree $3$ then $rc (G)=2$.Expand

A lower bound for the maximum cardinality of a k-independent set—in terms of degree sequences—is proved which strengthens and generalizes several previously known results, including Turan's theorem.Expand

A non-trivial upper bound for T(n, F, r) is computed for the maximum possible number of edges in a graph with n vertices, which contains each member of F at most r?1 times.Expand

It is proved that the connected domination number of G, denoted $\gamma_c(G)', is the minimum cardinality of a connected dominating set and two algorithms that construct a set this good are presented.Expand