最終更新日：2025/12/04
(graph theory) A square n⨯n matrix which describes an undirected graph of n vertices by letting rows and columns correspond to vertices, letting its diagonal elements contain the degrees of corresponding vertices and letting its non-diagonal elements contain either −1 or 0 depending on whether there is or there is not (respectively) an edge connecting the pair of corresponding vertices.
音声機能が動作しない場合はこちらをご確認ください
正解を見る
Laplacian matrix
編集履歴（0）
元となった辞書の項目
Laplacian matrix
名詞
(graph
theory)
A
square
n⨯n
matrix
which
describes
an
undirected
graph
of
n
vertices
by
letting
rows
and
columns
correspond
to
vertices,
letting
its
diagonal
elements
contain
the
degrees
of
corresponding
vertices
and
letting
its
non-diagonal
elements
contain
either
−1
or
0
depending
on
whether
there
is
or
there
is
not
(respectively)
an
edge
connecting
the
pair
of
corresponding
vertices.
日本語の意味
無向グラフの各頂点を表すn個の行と列に対応し、対角成分には各頂点の次数（その頂点に接続する辺の数）が記録され、非対角成分には対応する頂点間に辺が存在する場合は−1、存在しない場合は0が記録される正方行列。
意味（1）
(graph
theory)
A
square
n⨯n
matrix
which
describes
an
undirected
graph
of
n
vertices
by
letting
rows
and
columns
correspond
to
vertices,
letting
its
diagonal
elements
contain
the
degrees
of
corresponding
vertices
and
letting
its
non-diagonal
elements
contain
either
−1
or
0
depending
on
whether
there
is
or
there
is
not
(respectively)
an
edge
connecting
the
pair
of
corresponding
vertices.
（ plural ）
