For connected graphs G with |V(G)| >= 4, Aut(G) ≅ Aut(C(G)) ≅ Aut(M(G)) as abstract groups, which yields new upper bounds on the distinguishing number and index of the central and middle 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
-
Automorphism groups and Distinguishing Colorings of Central and Middle Graphs
For connected graphs G with |V(G)| >= 4, Aut(G) ≅ Aut(C(G)) ≅ Aut(M(G)) as abstract groups, which yields new upper bounds on the distinguishing number and index of the central and middle graphs.