10 citations · 10 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2019★ 10 cited
Number of Distinguishing Colorings and Partitions
Bahman Ahmadi, Fatemeh Alinaghipour, Mohammad Hadi Shekarriz
A vertex coloring of a graph is called distinguishing (or symmetry breaking) if no non-identity automorphism of preserves it, and the distinguishing number, shown by …
math.CO2013
Minimum number of distinct eigenvalues of graphs
Bahman Ahmadi, Fatemeh Alinaghipour, Michael S. Cavers +3
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph , is denoted by . Using other parameters related to , b…