Abstract: The maximum cardinality of a partition of the vertex
set of a graph Ginto neighborhood sets is the nomatic number of G,
denoted by We consider
Nordhaus-Gaddum type results involving the nomatic number of a graph, where a
Nordhaus-Gaddum type result is a lower or upper bound on the sum or product of a
parameter of a graph and its complement. In this paper, we obtain the upper
bounds on the sum and product of the nomaticnumbersandwhere
Keywords and phrases: neighborhood number, domatic number, nomatic numbers.
