For any graph with distinguishing number 2 and determining number 2, the cost number is at most 4, settling Boutin's open question in this case.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Distinguishing Graphs and Cost Number using Automorphism Representations
For any graph with distinguishing number 2 and determining number 2, the cost number is at most 4, settling Boutin's open question in this case.