「VERTEX」の共起表現一覧(1語右が「has」)
該当件数 : 13件
| An isolated | vertex has no adjacent vertices. |
| Each | vertex has exactly m incoming and m outgoing edges. |
| In the plane, each | vertex has on average six surrounding triangles. |
| in a Cn equals the number of edges, and every | vertex has degree 2; that is, every vertex has exactl |
| special case of a pseudoforest in which every | vertex has outdegree exactly 1. |
| d graph is a pseudoforest if and only if every | vertex has outdegree at most 1. |
| This graph is strongly regular; any | vertex has 16 neighbors, any 2 adjacent vertices have |
| e the number of orientations of such that each | vertex has two inwardly directed and two outwardly di |
| )-graph is defined to be a graph in which each | vertex has exactly r neighbors, and in which the shor |
| h of a simple polyhedron if it is cubic (every | vertex has three edges), and it is the graph of a sim |
| of its vertices with k colours such that each | vertex has at most d neighbours having the same colou |
| other words, a graph is semi-symmetric if each | vertex has the same number of incident edges, and the |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
