10 citations · 10 across the 3 of their papers we have counts for
3 papers
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 …
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…
The minimum rank of universal adjacency matrices
Bahman Ahmadi, Fatemeh Alinaghipour, Shaun M. Fallat +3
In this paper we introduce a new parameter for a graph called the {\it minimum universal rank}. This parameter is similar to the minimum rank of a graph. For a graph the minimu…