1. A note on the domination number of a graph and its complement Creator: Marcu, Dănuţ Format: bez média and svazek Type: model:article and TEXT Subject: graphs, domination number, and graph’s complement Language: English Description: If G is a simple graph of size n without isolated vertices and G is its complement, we show that the domination numbers of G and G satisfy γ(G) + γ(G) ≤ { n − δ + 2 if γ(G) > 3, δ + 3 if γ(G) > 3, where δ is the minimum degree of vertices in G. Rights: http://creativecommons.org/publicdomain/mark/1.0/ and policy:public