Last Updated :2025/12/04

Laplacian matrix

Noun
Japanese Meaning
無向グラフの各頂点を表すn個の行と列に対応し、対角成分には各頂点の次数(その頂点に接続する辺の数)が記録され、非対角成分には対応する頂点間に辺が存在する場合は−1、存在しない場合は0が記録される正方行列。
What is this buttons?

ネットワークの連結成分の数を求めるには、対角成分に頂点の次数を、非対角成分に隣接する頂点なら−1、それ以外は0を持つグラフのラプラシアン行列の零固有値の重複度を解析すればよい。

plural

Quizzes for review

(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.

音声機能が動作しない場合はこちらをご確認ください
See correct answer

Laplacian matrix

To determine the number of connected components in a network, one can analyze the multiplicity of the zero eigenvalue of the Laplacian matrix.

See correct answer

To determine the number of connected components in a network, one can analyze the multiplicity of the zero eigenvalue of the Laplacian matrix.

音声機能が動作しない場合はこちらをご確認ください

English - English

Word Edit Setting
  • Users who have edit permission for words - All Users
  • Screen new word creation
  • Screen word edits
  • Screen word deletion
  • Screen the creation of new headword that may be duplicates
  • Screen changing entry name
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Sentence Edit Setting
  • Users who have edit permission for sentences - All Users
  • Screen sentence deletion
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Quiz Edit Setting
  • Users who have edit permission for quizzes - All Users
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★