Antidomatic number of a graph
Bohdan Zelinka (1997)
Archivum Mathematicum
Similarity:
A subset of the vertex set of a graph is called dominating in , if for each there exists adjacent to . An antidomatic partition of is a partition of , none of whose classes is a dominating set in . The minimum number of classes of an antidomatic partition of is the number of . Its properties are studied.