RELATIONS BETWEEN THE DOMINATION PARAMETERS AND THE CHROMATIC
Pełen tekst
Denote G 1 = G − A and calculate the sum of degrees in G 1 of vertices u ∈ N(A). On the one hand P u∈N(A) d G1
Powiązane dokumenty
On the other hand, if the goal is only to distinguish every two adjacent vertices in G by a vertex coloring, then this can be accomplished by means of a proper coloring of G and
Radio (d − 1)-colorings are referred to as radio antipodal coloring or, more simply, as an antipodal coloring, and the radio (d − 1)-chromatic number is called the antipodal
The study of combinatorial problems on chessboards dates back to 1848, when German chess player Max Bezzel [2] first posed the n-queens problem, that is, the problem of placing n
In this section we used a standard random number generator which we verified to return a nearly uniform distribution for samples of size 10 6 lending some credibility to the
and one can obtain the estimate (H) for an arbitrary plurisubharmonic func- tion ϕ in Ω, where instead of |α| 2 i∂∂ϕ we take a function H satisfying (2) (see [3] for
Domination parameters in random graphs G(n, p), where p is a fixed real number in (0, 1), are investigated.. We show that with probability tending to 1 as n → ∞, the total
To the best knowledge of the author, there has been no similar Gallai-type equality so far for total domination number in the literature.. In this paper we will provide such
The split domination number of P 2 ¤P n is calculated, and we give good estimates for the split domination number of P m ¤P n expressed in terms of its domina- tion number..