最終更新日：2025/12/05
(graph theory) A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”.
音声機能が動作しない場合はこちらをご確認ください
正解を見る
medial graph
編集履歴（0）
元となった辞書の項目
medial graph
名詞
(graph
theory)
A
graph
derived
from
a
given
plane
graph
such
that
this
derived
graph
has
a
vertex
corresponding
to
each
edge
of
the
given
graph,
and
such
that
for
every
“angle”
(consecutive
trio
of
edge,
vertex,
edge)
along
the
border
of
a
face
of
the
given
graph
there
is
a
corresponding
edge
which
connects
the
vertices
corresponding
to
the
two
edges
that
are
part
of
that
“angle”.
日本語の意味
与えられた平面グラフから派生したグラフ。具体的には、元のグラフの各辺に1つの頂点が対応し、元のグラフの各面の境界上の連続する【辺・頂点・辺】の組（角）に対して、その角に関係する2つの辺に対応した頂点同士を結ぶ辺を持つグラフ。
意味（1）
(graph
theory)
A
graph
derived
from
a
given
plane
graph
such
that
this
derived
graph
has
a
vertex
corresponding
to
each
edge
of
the
given
graph,
and
such
that
for
every
“angle”
(consecutive
trio
of
edge,
vertex,
edge)
along
the
border
of
a
face
of
the
given
graph
there
is
a
corresponding
edge
which
connects
the
vertices
corresponding
to
the
two
edges
that
are
part
of
that
“angle”.
（ plural ）
