小窓モード

プレミアム

ログイン
設定

設定

「VERTEX」の共起表現一覧(1語左が「one」)

該当件数 : 19



The Desargues graph has one vertex for each point, one vertex for each line, and
ph; both parts of the bipartite graph have one vertex for each vertex of G.
Exactly one vertex of out-degree 0 (no outgoing arcs), called the
as a single fan, by arbitrarily selecting one vertex as the center.
the three paths between them have exactly one vertex in common.
It has one vertex for each arc in the set, and an edge between e
pe formed by joining two triangles at just one vertex is not a proper polyabolo.
of a graph such that there exists exactly one vertex for which all adjoining edges are oriented inw
s and directed edges, each edge connecting one vertex to another, such that there is no way to start
even component independently, and matching one vertex of an odd component C to a vertex in U and the
The simplex graph has one vertex for every simplex in the clique complex X(G) o
form the clique graph, as is every set of one vertex and every set of two adjacent vertices.
ph G, one may form a switch graph that has one vertex for every corresponding pair of vertices in G
Therefore, removing one vertex from each short cycle leaves a smaller graph w
pendent set I such that I contains exactly one vertex from each path in P. Dilworth's theorem follow
ollapsed into a point, losing one edge and one vertex, and changing two squares into triangles.
Given a CW complex S containing one vertex, one edge, one face, and generally exactly one
ny cell complex C is a flag complex having one vertex per cell of C. A collection of vertices of the
t matching (a matching that covers all but one vertex in a graph with an odd number of vertices).
                                                                                                    


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS