37 citations · 79 across the 37 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.SP2011
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…
math.CO2011★ 32 cited
Variants on the minimum rank problem: A survey II
Shaun Fallat, Leslie Hogben
The minimum rank problem for a (simple) graph is to determine the smallest possible rank over all real symmetric matrices whose th entry (for ) is nonzero whenever…