正則グラフ
1. Regular graphIn graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other. A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k.
Read “Regular graph” on English Wikipedia
Read “正則グラフ” on Japanese Wikipedia
Read “Regular graph” on DBpedia
Read “Regular graph” on English Wikipedia
Read “正則グラフ” on Japanese Wikipedia
Read “Regular graph” on DBpedia
Discussions
Log in to talk about this word.