The outer-weakly convex domination number is determined exactly for Cartesian, strong, and lexicographic products of connected graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Revisiting the outer-weakly convex domination number in graph products
The outer-weakly convex domination number is determined exactly for Cartesian, strong, and lexicographic products of connected graphs.