noncomputable def SimpleGraph.cvetkovic {α : Type u_1} [Fintype α] [DecidableEq α] (G : SimpleGraph α) [DecidableRel G.Adj] : ℕ

Given a simple graph G with adjacency matrix A, this is the number n₀ + min n₊ n₋ where:

• n₀ is the multiplicity of zero as an eigenvalue of A
• n₊ is the number of positive eigenvalues of A (counting multiplicities)
• n₋ is the number of negative eigenvalues of A (counting multiplicities)

Equations

• One or more equations did not get rendered due to their size.