Optimal Domination in Graphs

Cockayne, E., & Hedetniemi, S. T. (1975). Optimal Domination in Graphs. IEEE, 22(11), 855-857.

Type

Journal article

Intellectual base

Primary research

Year

1975

DOI

10.1109/tcs.1975.1083994

Link

https://doi.org/10.1109/tcs.1975.1083994

Cited by

1 citation across 1 artifact.

Domain-specific

• Domatic number
  • The domatic number \(d(G)\) is the maximum integer \(k\) for which \(V(G)\) has a partition \(\{D_1,\ldots,D_k\}\) and every block \(D_i\) is a dominating set of \(G\).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:23d6ce86b739 · see in the full table