The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
Complexity aspects of the computation of the rank of a graph
2 Pith papers cite this work, alongside 12 external citations. Polarity classification is still indexing.
2
Pith papers citing it
12
external citations · OpenAlex
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.
citing papers explorer
-
The Normal Domination Partizan Game in Stars
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
-
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
Relates signed total Roman domination number on cubic graphs to open packing, 2-tuple total domination, and signed total domination numbers to derive bounds and NP-completeness; shows domatic number determined by degree-3 vertices; computes exact values on complete multipartite graphs.