The minimum semi-definite rank (msr) of a graph is the minimum rank among all positive semi-definite matrices associated to the graph. The graph complement conjecture gives an upper bound for the sum of the msr of a graph and the msr of its complement. It is shown that when the msr of a graph is equal to its independence number, the graph complement conjecture holds with a better upper bound. Several sufficient conditions are provided for the msr of different classes of graphs to equal to its independence number.
|الصفحات (من إلى)||399-406|
|دورية||Electronic Journal of Linear Algebra|
|المعرِّفات الرقمية للأشياء|
|حالة النشر||Published - 2018|
ASJC Scopus subject areas