Computes exact distinguishing chromatic numbers for middle graphs and equates distinguishing numbers for subdivision graphs to total distinguishing numbers.
Hamada and I.Yoshimura, Traversability and connectivity of th e middle graph of a graph, Discrete Math
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2representative 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.
- Automorphism groups and Distinguishing Colorings of Central and Middle Graphs