Taiwanese Journal of Mathematics, Vol. 14, No. 4 (August 2010), pp. 1537-1542 (6 pages) The domination number γ(G) of a graph G is the minimum cardinality among all dominating sets of G, and the ...
Abstract.Let 𝐺 be a graph, and let 𝑔 and 𝑓 be two integer-valued functions defined on 𝑉(𝐺) satisfying 𝑎 ≤ 𝑔(𝑥) ≤ 𝑓(𝑥)-𝑟 ≤ 𝑏 - 𝑟 for any 𝑥∈ 𝑉(𝐺), where 𝑎,𝑏 and r be three nonnegative ...
In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback