2 papers
math.CO2026
On fixing and distinguishing numbers of trees
Calum Buchanan, Peter Dankelmann, Isabel Harris +3
A graph is -distinguishable if there is a labeling of its vertices with labels such that the only automorphism of which preserves the labeling is the identity. The d…
math.CO2022
Diameter of orientations of graphs with given order and number of blocks
P. Dankelmann, M. J. Morgan, E. J. Rivett-Carnac
A strong orientation of a graph is an assignment of a direction to each edge such that is strongly connected. The oriented diameter of is the smallest diameter among al…