For unitary Cayley graphs X_n, the author constructs n with arbitrarily many prime factors satisfying γ_t(X_n) ≤ g(n) - 16, and classifies all products of complete graphs with domination number t+2.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Domination in direct products of complete graphs
For unitary Cayley graphs X_n, the author constructs n with arbitrarily many prime factors satisfying γ_t(X_n) ≤ g(n) - 16, and classifies all products of complete graphs with domination number t+2.