閉路グラフ
Sign in to saveAlso known as circular graph, simple cycle graph, polygon graph
graph that consists of a single cycle
In the Vinony graph
Vinony's link graph records 181 inbound references to 閉路グラフ, and connects out to graph, edge coloring and cycle graph.
Vinony files it under Parametric families of graphs and Regular graphs.
Vinony links it to 24 Wikipedia language editions.
Wikidata facts
- Has part
- cycle
- Image
- Intercpunetring.png
Show 5 more facts
- studied by
- graph theory
- maintained by WikiProject
- WikiProject Mathematics
- Commons category
- Cycle graphs
- different from
- cycle graph
- has characteristic
- degree
Sources (1)
via Wikidata · CC0
Article · 日本語
閉路グラフ（へいろグラフ、英: cycle graph）は、グラフ理論において1つの閉路から成るグラフをいう。言い換えれば、いくつかの辺が相互に連なって1つの輪を形成しているグラフである。n個の辺による閉路グラフを Cn と表記する。Cn においては、辺と頂点の数は等しく、各頂点の次数は常に2である。つまり、各頂点は常に2つの辺と接合している。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
graph
Entity
edge coloring
Entity
cycle graph
Entity
International Standard Book Number
Entity
digital object identifier
Entity
synonym
Entity
graph theory
Entity
JSTOR
Organization
regular polygon
Entity
if and only if
Entity
MathWorld
Entity
complete graph
Entity
Semantic Scholar
Entity
node
Entity
graph coloring
Entity
Springer Science+Business Media
Entity
directed graph
Entity
cyclic group
Entity
Hamiltonian path
Entity
bipartite graph
Entity