Information | |
---|---|
has gloss | eng: In the mathematical field of graph theory the Laplacian matrix, sometimes called admittance matrix or Kirchhoff 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. The Laplacian matrix can be used to find many other properties of the graph, see spectral graph theory. |
lexicalization | eng: Laplacian matrix |
instance of | (noun) (mathematics) a rectangular array of quantities or expressions set out by rows and columns; treated as a single element and manipulated according to rules matrix |
Meaning | |
---|---|
Finnish | |
has gloss | fin: Verkkoteoriassa Laplacen matriisi eli Kirchhoffin matriisi on verkon matriisiesitys. Tätä voidaan käyttää verkon virittäjäpuun laskemiseen. |
lexicalization | fin: Laplacen matriisi |
French | |
has gloss | fra: En théorie des graphes, une matrice laplacienne, ou matrice de Laplace, est une matrice représentant un graphe. |
lexicalization | fra: Matrice Laplacienne |
Russian | |
has gloss | rus: Матрица Кирхгофа — одно из представлений графа с помощью матрицы. Матрица Кирхгофа используется для подсчета остовных деревьев данного графа (матричная теорема о деревьях), а также используется в спектральной теории графов. |
lexicalization | rus: Матрица Кирхгофа |
Media | |
---|---|
media:img | 6n-graf.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint