For regular, diameter-2, and diameter-3 cut-vertex character degree graphs metric dimension formulas are given; the Fitting-height-2 formula is contradicted by a graph satisfying the paper's own Lewis criterion.
Babai, On the complexity of canonical labeling of strongly regular graphs, SIAM J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On the metric dimension of the character degree graph of a solvable group
For regular, diameter-2, and diameter-3 cut-vertex character degree graphs metric dimension formulas are given; the Fitting-height-2 formula is contradicted by a graph satisfying the paper's own Lewis criterion.