Showing math.COShow all
3 papers · 1 filter
math.CO2018
Distinguishing locally finite trees
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color the vertices of such that the only color preserving automorphism is the…
math.CO2017
Distinguishing graphs of maximum valence 3
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color such that the only color preserving automorphism is the identity. We gi…
math.CO2016
Edge-transitive bi-Cayley graphs
Marston Conder, Jin-Xin Zhou, Yan-Quan Feng +1
A graph $\G$ admitting a group of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over . Such a graph $\G$ is…