Theorem
The following graphs are all the connected graph with positive definite and positive semidefinite.
Positive Definite Coxeter Graph
- :
- :
- :
- :
- :
- :
- :
- :
- :
- :
The cases can be checked directly. For example, the matrix corresponding to the graph is
det(2A) = .
If , the graph above shows that it is possible to number vertices in such a way that the last vertex (numbered ) is joined by an edge to only one other vertex (numbered ), this edge being labelled or . Let be the determinant of the upper left submatrix of . Then an expansion of along the last row shows that
where (resp. ) if (resp. ). Keeping in mind that we multiply each matrix by , we compute inductively the values in the following table.
The reader should carry out the required verification as an exercise, recalling the values:
(If the value of is not so familiar, look at the derivation in Bourbaki [1], p. 192 (footnote).)
As an example, we work through the cases of and . For the smaller minors come from graphs of types and , so formula (1) reads:
For the smaller minors are of types and , yielding:
Positive Semidefinite Coxeter Graphs
- :
- :
- :
- :
- :
- :
- :
- :
- :
- :
- :