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. Mathematics, often abbreviated maths in Commonwealth English and math in American English, is the study of abstraction. ...
In mathematics and computer science, graph theory studies the properties of graphs. ...
For the square matrix section, see square matrix. ...
This article just presents the basic definitions. ...
A spanning tree (red) of a graph (black), superimposed In the mathematical field of graph theory, a spanning tree of a connected, undirected graph is a tree which includes every vertex of that 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*. In mathematics and computer science, the adjacency matrix for a finite graph on n vertices is an n × n matrix in which entry aij is the number of edges from vi to vj in . ...
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 |