'Petersen graph' diaporamas de présentation

Graph Theory

1.82k views • 139 slides

??? Hong-Gwa Yeh ???? , ?? hgyeh@math.ncu.tw July 31, 2009

Some Results on Labeling Graphs with a Condition at Distance Two. ??? Hong-Gwa Yeh ???? , ?? hgyeh@math.ncu.edu.tw July 31, 2009. Channel-Assignment Problem. Hale, 1980. Hale, 1980, IEEE. 1. 1. 1. 1. 2. 1. 1. 2. 2. 2. 3. 1. 3. 1. 1. 3. 1. Chromatic number = 3. 2. 2.

827 views • 66 slides

Covering Graphs

Covering Graphs. Motivation: Suppose you are taken to two different labyrinths. Is it possible to tell they are distinct just by walking around? Let us call the first graph maze X, and the second one Y. Question. Is it possible to distinguish between the two mazes?

870 views • 59 slides

Optimal Networks

585 views • 43 slides

On Mod(3)-Edge -magic Graphs

On Mod(3)-Edge -magic Graphs. Sin-Min Lee , San Jose State University Karl Schaffer , De Anza College Hsin-hao Su * , Stonehill College Yung-Chin Wang , Tzu- Hui Institute of Technology 6th IWOGL 2010 At University of Minnesota, Duluth October 22, 2010. Supermagic Graphs.

600 views • 40 slides

Graphs

619 views • 38 slides

Cayley Graphs & Expanders

Steve the presenter. Cayley Graphs & Expanders. Some history. Arthur Cayley. Son of a British merchant in Russia who wedded a Russian girl. English Super Genius Did everything Very smart and knew more than 6 languages including yours and math.

678 views • 36 slides

On k-Edge -magic Cubic Graphs

On k-Edge -magic Cubic Graphs. Sin-Min Lee , San Jose State University Hsin-hao Su *, Stonehill College Yung-Chin Wang , Tzu-Hui Institute of Technology 24th MCCCC At Illinois State University September 11, 2010. Supermagic Graphs.

458 views • 36 slides

Hamilton Paths & Circuits in Special Graphs

Hamilton Paths & Circuits in Special Graphs. By: Todd Waters & Maya Robinson. Traveling Salesman Problem. The objective is to visit a number of cities once and return home with the minimum amount of travel.

507 views • 18 slides