逢甲學報, Band 15逢甲大學, 1982 |
Im Buch
Ergebnisse 1-3 von 14
Seite
... graph is a linear com- bination of these basic matrices . We prove that every finite connected vertex- transitve graph with more than three vertices has a Hamiltonian cycle if its automorphism group contains an abelian regular subgroup ...
... graph is a linear com- bination of these basic matrices . We prove that every finite connected vertex- transitve graph with more than three vertices has a Hamiltonian cycle if its automorphism group contains an abelian regular subgroup ...
Seite
... graph X. A u - y walk of X is defined to be a finite , alternating sequence of vertices and edges of X , begining ... graph X is a u - v path in which u = v . A path ( cycle ) containing all vertices of X is called a Hamiltonian path ...
... graph X. A u - y walk of X is defined to be a finite , alternating sequence of vertices and edges of X , begining ... graph X is a u - v path in which u = v . A path ( cycle ) containing all vertices of X is called a Hamiltonian path ...
Seite
... graph contains a polygon C , with 3 , or 4 , or 5 . n = Theorem 2.3 . ( Euler's Formula ) For any plane map with p ... graph has a Hamilto- nian cycle . The planarity of this theorem is a necessary condition . To illustrate this property ...
... graph contains a polygon C , with 3 , or 4 , or 5 . n = Theorem 2.3 . ( Euler's Formula ) For any plane map with p ... graph has a Hamilto- nian cycle . The planarity of this theorem is a necessary condition . To illustrate this property ...