最終更新日：2025/12/05
(graph theory) A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides.
音声機能が動作しない場合はこちらをご確認ください
正解を見る
dual graph
編集履歴（0）
元となった辞書の項目
dual graph
名詞
(graph
theory)
A
graph
derived
from
some
plane
graph
in
such
a
way
that
the
derived
graph
has
a
vertex
corresponding
to
each
face
of
the
given
graph,
an
edge
corresponding
to
each
edge
of
the
given
graph
that
is
shared
by
a
pair
of
distinct
faces,
and
a
self-loop
for
each
edge
of
the
given
graph
that
is
a
border
of
the
same
face
on
both
of
its
sides.
日本語の意味
（グラフ理論）ある平面グラフから派生して構成されるグラフで、元のグラフの各面に対応する頂点が存在し、元のグラフの各辺が、異なる2つの面を共有する場合にはそれらの面に対応する頂点間を結ぶ辺となり、もし同じ面の境界にある場合には自己ループとなる。
意味（1）
(graph
theory)
A
graph
derived
from
some
plane
graph
in
such
a
way
that
the
derived
graph
has
a
vertex
corresponding
to
each
face
of
the
given
graph,
an
edge
corresponding
to
each
edge
of
the
given
graph
that
is
shared
by
a
pair
of
distinct
faces,
and
a
self-loop
for
each
edge
of
the
given
graph
that
is
a
border
of
the
same
face
on
both
of
its
sides.
（ plural ）
