5 citations · 7 across the 2 of their papers we have counts for
2 papers
math.CO2021★ 2 cited
Distinguishing threshold for some graph operations
Mohammad Hadi Shekarriz, Seyed Alireza Talebpour Shirazi Fard, Bahman Ahmadi +2
A vertex coloring of a graph is distinguishing if non-identity automorphisms do not preserve it. The distinguishing number, , is the minimum number of colors required for…
math.CO2021★ 5 cited
Distinguishing threshold of graphs
Mohammad Hadi Shekarriz, Bahman Ahmadi, Seyed Alireza Talebpour Shirazi Fard +1
A vertex coloring of a graph is called distinguishing if no non-identity automorphisms of can preserve it. The distinguishing number of , denoted by , is the minim…