Pages that link to "Item:Q389670"

The following pages link to Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670):

Displaying 8 items.

• Graphs with least eigenvalue \(-2\): ten years on (Q491141) (← links)
• On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\) (Q2078839) (← links)
• Graphs \(G\) with nullity \(n(G) - g(G) -1\) (Q2133682) (← links)
• On connected signed graphs with rank equal to girth (Q2158277) (← links)
• On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
• Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
• On the algorithmic complexity of zero-sum edge-coloring (Q2630333) (← links)