「Hamiltonian」の共起表現一覧(1語左が「a」)
該当件数 : 36件
| They are the trees whose square is a | Hamiltonian graph. |
| onnected vertex-transitive graph contains a | Hamiltonian path. |
| ry finite connected Cayley graph contains a | Hamiltonian cycle. |
| Every Halin graph is a | Hamiltonian graph, and every edge of the graph belongs |
| If there is a | Hamiltonian path in the graph, then the algorithm will |
| Clearly, if a certain general graph has a | Hamiltonian path, this Hamiltonian path is the longest |
| tonian-connected graphs (graphs that have a | Hamiltonian path connecting every pair of vertices). |
| Suppose the dynamics can be described by a | Hamiltonian of the form |
| that a strongly connected tournament has a | Hamiltonian cycle (Camion 1959). |
| only Archimedean dual which does not have a | Hamiltonian path among its vertices. |
| njecture, the graph of the polyhedron has a | Hamiltonian cycle. |
| Let G be a finite planar graph with a | Hamiltonian cycle C. |
| cture that every 3-regular polyhedron has a | Hamiltonian cycle. |
| The Anderson Impurity Model is a | Hamiltonian model that is often used to describe heavy |
| Additionally, a | Hamiltonian path exists between vertices u,v iff u,v ar |
| ch pair of vertices can be connected with a | Hamiltonian path (Thomassen 1980). |
| sists of one path if and only if there is a | Hamiltonian path in G. |
| condition on the planar graph to contain a | Hamiltonian cycle. |
| In physics and classical mechanics, a | Hamiltonian system is a physical system in which forces |
| enty (in ancient Greek icosa) edges (i.e. a | Hamiltonian circuit on the icosahedron). |
| Arnowitt and Stanley Deser, he published a | Hamiltonian formulation of the Einstein equation that s |
| r instance, suppose one is given as input a | Hamiltonian cycle in a cubic graph; it follows from Smi |
| "Every 3-connected planar cubic graph has a | Hamiltonian cycle (along the edges) through all its ver |
| In mathematics, a | Hamiltonian system is a system of differential equation |
| of an arbitrary tree so that it contains a | Hamiltonian path (the size of its Hamiltonian completio |
| raph is a subgraph of a planar graph with a | Hamiltonian cycle; for instance, the Goldner-Harary gra |
| x is incident to exactly three edges) has a | Hamiltonian cycle, but this conjecture was disproved by |
| ices, the Herschel graph does not contain a | Hamiltonian cycle (a cycle of edges that passes through |
| the graph without repetition, and this is a | Hamiltonian path by definition. |
| ceable graphs, graphs that do not contain a | Hamiltonian path but such that every subset of n − 1 ve |
| y are the trees whose line graphs contain a | Hamiltonian path; such a path may be obtained by the or |
| The game's object is finding a | Hamiltonian cycle along the edges of a dodecahedron suc |
| ternatively, a 4-coloring of the faces of a | Hamiltonian cubic planar graph may be constructed direc |
| bipartite cubic polyhedron, there exists a | Hamiltonian cycle that contains e but does not contain |
| If G has a | Hamiltonian cycle, then the square of G (the graph on t |
| Gomory's theorem can be proven using a | Hamiltonian cycle of the grid graph formed by the chess |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
