Hamilton Graph Theory

โดย 1. นายธนพัฒน� อัตถกิ�จมงคล ม 67. / เลขที่�� 14 2 . นายเศรษฐพังศ� อัศวรตน� ม 67. / เลขที่�� 20 3 . นายสุ!ภาเที่พั ตณศ�ร�ชัยยา ม 67. / เลขที่�� 22

กิราฟแฮม�ลตนกิราฟแฮม�ลตนเซอัร�ว�ลเล�ยม โร

แวน แฮม�ลตน (Sir William Rowan Hamilton) นกิ

คณ�ตศาสุตร�ชัาวไอัร�ชั ได*ประด�ษฐ�กิ*อันไม*ที่��ม� 20

ม!ม และประกิอับด*วยร.ปห้*าเห้ล��ยมด*านเที่0าจ1านวน 12

ห้น*า

กิราฟแฮม�ลตนกิราฟแฮม�ลตนป2ญห้ากิ4ค5อักิารห้าเสุ*นที่างโดย

เร��มจากิเม5อังห้น6�ง ๆ แล*วไล0ตามขอับขอังกิ*อันไม*ไปเร5�อัย ๆ เพั5�อัที่��จะแวะ

ผ่0านที่!กิ เม5อัง เม5อังละ 1 คร9ง แล*ววนกิลบสุ.0เม5อังที่��ต9งต*น

ว�ถ�และวงจรแฮม�ลตน

ให้* G = (V,E) เป;นกิราฟ ว�ถ�แฮม�ลตน

(Hamiltonian Path) ค5อัว�ถ�ในกิราฟซ6�งใชั*จ!ดที่!กิจ!ดเพั�ยงจ!ดละ 1 คร9ง โดยไม0จ1าเป;นต*อังใชั*เสุ*นเชั5�อัมครบที่!กิเสุ*น และถ*าจ!ดยอัดเร��มต*นกิบจ!ดยอัดสุ!ดที่*าย

ขอังว�ถ�เป;นจ!ดเด�ยวกิน จะเร�ยกิว0า วงจรแฮม�ลตน (Hamiltonian

Circuit)

ตวอัย0าง กิารห้าวฏจกิรแฮม�ลโที่เน�ยนขอังกิราฟ

a b c

h

ge

f

d.

G

กิราฟม� วฏจกิรแฮม�ลตน โดยม�เสุ*นที่างเด�น ค5อั a , b , c , h , g , e , f , d , a

16-Cell

• The 16-cell is the finite regular four-dimensional. It is also known as the hyperoctahedron or hexadecachoron, and its composed of 16 tetrahedra, with 4 to an edge .It has 8 vertices, 24 edges, and 32 faces. The 16-cell. It has

distinct nets .

24-Cell

• The 24-cell is a finite regular four-dimensional . It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 octahedra, with

3 to an edge . The 24-cell has 24 vertices and 96 edges . It is one of the six regular polychora . The 24-cell has

distinct nets.

120-Cell

• The 120-cell is a finite regular four-dimensional, also known as the hyperdodecahedron or hecatonicosachoron, and composed of 120 dodecahedra, with 3 to an edge, and 720 pentagons

.The 120-cell has 600 vertices and 1200 edges .

600-Cell

• The 600-cell is the finite regular four-dimensional . It is also known as the hypericosahedron or hexacosichoron . It is composed of 600 tetrahedra, with

5 to an edge . The 600-cell has 120 vertices and 720 edges .

Balaban 10-Cage

• It is a Hamiltonian graph and has

91440 Hamiltonian cycles . The Balaban 10-cage is one of the three -cage graphs .

Bidiakis Cube

• The 12-vertex graph consisting of

a cube in which two opposite faces

(say, top and bottom ) have edges drawn across them which connect the centers of opposite sides of the faces in such a way that the orientation of the edges added on top and bottom are perpendicular

to each other .

Biggs-Smith graph

• The Biggs-Smith graph is cubic symmetric graph on 102 vertices and

153 edges that is also distance-regular .

Bislit Cube

• The bislit cube is the 8-vertex simple

graph consisting of a cube in which two

opposite faces have polyhedron diagonals

oriented perpendicular to each other .

Brinkmann Graph

• The Brinkmann graph is a weakly regular quartic graph on 21 vertices and 42 edges .

Clebsch Graph

• The Clebsch graph, also known as the Greenwood-Gleason graph , is a strongly regular quintic graph

on 16 vertices and 40 edges

Cubical Graph

• The cubical graph is the Platonic graph

corresponding to the connectivity of the cube . It is equivalent to the

generalized Petersen graph . The cubical

graph has 8 nodes, 12 edges.

Cuboctahedral Graph

• An Archimedean symmetric quartic graph

on 12 nodes and 24 edges that is the skeleton of the cuboctahedron . The

cuboctahedral graph is the line graph of

the cubical graph .

Desargues Graph • The Desargues graph is a cubic

symmetric graph distance-regular graph on 20 vertices and 30

edges.

Diamond Graph

• The diamond graph is the simple graph on 4 nodes and 5 edges

illustrated above .

Disdyakis Dodecahedral Graph

• The disdyakis dodecahedral graph is Archimedean dual graph

which is the skeleton of the

disdyakis dodecahedron .

Disdyakis Dodecahedron

Dodecahedral Graph

• The dodecahedral graph is the Platonic graph corresponding to

the connectivity of the vertices of a dodecahedron . The

dodecahedral graph has 20 nodes, 30 edges.

Dyck Graph

• The unique cubic symmetric graph

on 32 nodes 48 edges. It is nonplanar.

Errera Graph

• The Errera graph is the 17-node planar graph. It is an example of

how Kempe's supposed proof of the four-color theorem fails .

Folkman Graph

• The Folkman graph is a semisymmetric graph that has the

minimum possible number of nodes (20 )

Foster Graph

• The " Foster graph is the cubic symmetric graph on 90 vertices

that has 135 edges

Wong Graph

The Wong graph is one of the four (5,5) -cage graphs. Like the other (5,5) -cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is a quintic graph.

Wells Graph

The Wells graph is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array (5, 4, 1, 1; 1, 1, 4, 5) . It is a double cover of the complement of the Clebsch graph (Brouwer et al. 1989, p. 266).

Utility Graph

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any of the gas/water/electric lines/pipes pass over any other. This is equivalent to the equation "Can a planar graph be constructed from each of three nodes ('houses') to each of three other nodes ('utilities')?" This problem was first posed in this form by H. E. Dudeney in 1917 (Gardner 1984, p. 92).

Unitransitive Graph

A graph G is n -unitransitive if it is connected, cubic, n-transitive, and if for any two n-routes W1 and W2

Truncated Tetrahedral Graph

The truncated tetrahedral graph is the cubic Archimedean graph on 12 nodes and 18 edges that is the skeleton of the truncated tetrahedron.

Truncated Octahedral Graph

The truncated octahedron graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron.

Truncated Icosahedral Graph

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. A number of embeddings are shown above.

Truncated Dodecahedral Graph

The cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron.

Truncated Cubical Graph

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube.

Triangle Graph

The triangle graph is the cycle graph C3 , which is also the complete graph K3 .

Triakis Tetrahedral Graph

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron.

Tetrahedral Graph

The Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K4 and therefore also the wheel graph W4 .

Tesseract

The tesseract is composed of 8 cubes with 3 to an edge, and therefore has 16 vertices, 32 edges, 24 squares, and 8 cubes. It is one of the six regular polychora.

Sylvester Graph

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5, 4, 2; 1, 1, 4}.

Square Graph

The cycle graph C4 .

Snub Dodecahedral Graph

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron. The snub dodecahedral graph is planar and Hamiltonian, and has chromatic number 4. It is vertex-transitive, although not edge-transitive because some edges are part of three-circuits while others are not.

Snub Cubical Graph

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and has chromatic number 3.

Small Rhombicuboctahedral Graph

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, graph radius 5, and chromatic number 3. It is also Hamiltonian. It is vertex-transitive, although not edge-transitive because some edges are part of three-circuits while others are not.

Small Rhombicosidodecahedral Graph

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron. It has graph diameter 8, graph radius 8, and chromatic number 3. It is also Hamiltonian. It is vertex-transitive, although not edge-transitive because some edges are part of three-circuits while others are not.

Robertson-Wegner Graph

The Robertson-Wegner graph has 30 nodes. It has 75 edges, girth 5, diameter 3, and chromatic number 4.

Robertson Graph

The Robertson graph has 19 vertices and 38 edges.

Pentatope

The pentatope is self-dual, has five three-dimensional facets (each the shape of a tetrahedron), 10 ridges (faces), 10 edges, and five vertices.

Pentakis Dodecahedral Graph

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron.

Pentagonal Icositetrahedral Graph

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron.

Pentagonal Hexecontahedral Graph

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron.

Pappus Graph

A cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings.

Octahedral Graph

The 6-node 12-edge Platonic graph having the connectivity of the octahedron

Möbius-Kantor Graph

The unique cubic symmetric graph on 16 nodes, illustrated above in two embeddings.

Meringer Graph

The Meringer graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 3, and is a quintic graph. The order of its automorphism group is 96.

McGee Graph

The McGee graph was discovered by McGee (1960) and proven unique by Tutte (1966; Wong 1982). It has 24 nodes, 36 edges, girth 7, diameter 4, and is a cubic graph.

Levi Graph

"The" Levi graph (right figure) is a graph based on Desargues' configuration which consists of the union of the two leftmost subgraphs illustrated above. It has 30 nodes and 45 edges. It has girth 8, diameter 4, chromatic number 2, and automorphism group order 1440.

Kittell Graph

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of the four-color theorem fails.

Icosidodecahedral Graph

A symmetric quartic graph on 30 nodes and 60 edges corresponding to the skeleton of the icosidodecahedron. It has graph diameter 5, graph radius 5, and chromatic number 3. It is also Hamiltonian.

Icosahedral Graph

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the icosahedron, illustrated above in a number of embeddings. The icosahedral graph has 12 vertices and 30 edges.

House Graph

The house graph is a simple graph on 5 nodes and 6 edges whose name derives from its resemblance to a schematic illustration of a house with a roof.

Hoffman-Singleton Graph

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5.

Hoffman Graph

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges.

Heawood Graph

The Heawood graph is the cage graph illustrated above in a number of embeddings. It is 4-transitive, but not 5-transitive (Harary 1994, p. 173).

Harries-Wong Graph

The Harries-Wong graph is one of the three (10,3) -cage graphs, the other two being the (10,3) -cage Balaban graph and the Harries graph.

Harries Graph

The Harries graph is one of the three (10,3) -cage graphs, the other two being the (10,3) -cage Balaban graph and the Harries-Wong graph.

Harborth Graph

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named after its discoverer H. Harborth, who first presented it to a general public in 1986 (Harborth 1986, Petersen 1996, Gerbracht 2006).

Grünbaum Graph

The Grünbaum graph can be constructed from the dodecahedral graph by adding an additional ring of five vertices around the perimeter and cyclically connecting each new vertex to three others as shown above (left figure). A more symmetrical embedding is shown in the right figure above. The Grünbaum graph has 25 vertices and 50 edges.

Grötzsch Graph

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski Graph of order four. It has 11 vertices and 20 edges. It is Hamiltonian, but nonplanar.

Great Rhombicuboctahedral Graph

The cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron.

Great Rhombicosidodecahedral Graph

The great rhombicosidodecahedral graph is the Archimedean graph on 120 vertices and 180 edges that is the skeleton of the great rhombicosidodecahedron. It is cubic, has chromatic number 2, and is planar and Hamiltonian.

Gray Graph

The Gray graph is a semisymmetric cubic graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnic et al. (2004) showed that the Gray graph is indeed the smallest possible semisymmetric cubic graph.

Gewirtz Graph

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10.

Frucht Graph

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It has 12 vertices and 18 edges. It is also both planar and Hamiltonian.

ที่ฤษฎี�บที่ขอังด�แรกิ(Dirac’s theoem)

กิราฟเชั�งเด�ยวที่��ม�จ!ดยอัด n จ!ด เม5�อั n >= 3 และจ!ดยอัดที่!กิจ!ดม�ด�กิร�อัย0างน*อัย n/2 แล*วกิราฟดงกิล0าวเป;นกิราฟแฮม�ลตน