Computes exact distinguishing chromatic numbers for middle graphs and equates distinguishing numbers for subdivision graphs to total distinguishing numbers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distinguishing chromatic number of middle and subdivision graphs
Computes exact distinguishing chromatic numbers for middle graphs and equates distinguishing numbers for subdivision graphs to total distinguishing numbers.