Science Fair Project Encyclopedia
Admittance matrix
In the mathematical field of graph theory the admittance matrix or Laplacian matrix 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.
Definition
The admittance matrix of a graph G is defined as
- L: = D - A
with D the degree matrix of G and A the adjacency matrix of G.
More explicitly, given a graph G with n vertices the admittance matrix
is defined as
In the case of directed graphs, either the indegree or the outdegree might be used, depending on the application.
See also
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


