Official title and information are available only for Plus and Premium subscribers.
Patent Granted In the mathematical field of graph theory, the Laplacian matrix, sometimes called admittance matrix, Kirchhoff matrix or discrete Laplacian, is a matrix representation of a graph. Together with Kirchhoff's theorem, it can be used to calculate the number of spanning trees for a given graph.
To see the additional information details please login and subscribe to a Plus or Premium account.
