Chapter 5: Globally 3*-connected graphs

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Coloring Warm-Up. A graph is 2-colorable iff it has no odd length cycles 1: If G has an odd-length cycle then G is not 2- colorable Proof: Let v 0, …,
Chapter 8 Topics in Graph Theory
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Graph-02.
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
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.
The Instant Insanity Game
Section 2.1 Euler Cycles Vocabulary CYCLE – a sequence of consecutively linked edges (x 1,x2),(x2,x3),…,(x n-1,x n ) whose starting vertex is the ending.
Definition Hamiltonian graph: A graph with a spanning cycle (also called a Hamiltonian cycle). Hamiltonian graph Hamiltonian cycle.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Some New Directions about Interconnection Networks.
The (Degree, Diameter) Problem By Whitney Sherman.
Chapter 4 Graphs.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
Graphs Chapter 10.
Panconnectivity and Edge- Pancyclicity of 3-ary N-cubes 指導教授 : 黃鈴玲 老師 學生 : 郭俊宏 Sun-Yuan Hsieh, Tsong-Jie Lin and Hui-Ling Huang Journal of Supercomputing.
Generalized Derangement Graphs Hannah Jackson.  If P is a set, the bijection f: P  P is a permutation of P.  Permutations can be written in cycle notation.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Chapter 6 Graph Theory R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001.
Based on slides by Y. Peng University of Maryland
Embedding long paths in k-ary n-cubes with faulty nodes and links
Planar Graphs Graph Coloring
A study of k-ordered hamiltonian graphs. Story begins L. Ng, M. Schultz, k-Ordered Hamiltonian graphs, J. Graph Theory 24 (1997) 45–57.
Discrete Mathematical Structures: Theory and Applications
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Hamiltonian Cycles Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Mutually Independent Hamiltonian Cycles on various interconnection networks- examples and theorems 海峽兩岸圖論與組合數學研討會 06/30/2011 高欣欣 中原大學應用數學系.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
1 The 3*-connected property of the pyramid networks Yuan-Hsiang Teng, Tzu-Liang Kung, Lih-Hsing Hsu Computers and Mathematics with Applications 60 (2010)
Trees.
An Introduction to Graph Theory
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
Outline 1 Properties of Planar Graphs 5/4/2018.
Euler and Hamiltonian Graphs
Graphs: Definitions and Basic Properties
Chapter 9 (Part 2): Graphs
Proof technique (pigeonhole principle)
A study of k-ordered hamiltonian graphs
The countable character of uncountable graphs François Laviolette Barbados 2003.
Heawood. Chapter 7: Cubic 4-ordered Hamiltonian and 4-ordered Hamiltonian connected/laceable graphs.
Grade 11 AP Mathematics Graph Theory
Graph theory Definitions Trees, cycles, directed graphs.
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
Some Interesting Properties of Interconnection Networks
Hamiltonian cycle part
Discrete Maths 9. Graphs Objective
Spanning Trees Discrete Mathematics.
Can you draw this picture without lifting up your pen/pencil?
Lecture 15: Graph Theory II
Maximum Flows of Minimum Cost
Discrete Math II Howon Kim
Applied Combinatorics, 4th Ed. Alan Tucker
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Hamiltonian Cycles.
Mathematics for Computer Science MIT 6.042J/18.062J
Euler and Hamiltonian Graphs
Simple Graphs: Connectedness, Trees
Gaph Theory Planar Graphs
Applied Combinatorics, 4th Ed. Alan Tucker
HW 3 (Due Wednesday Feb 6) Create slide(s) for your 1 minute presentation on a graph theory application. Make sure your slide(s) include (1) Define the.
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Fault-Tolerant Vertex-Pancyclicity of Crossed Cubes CQn
Cell construction scheme for various cubic fault tolerant Hamiltonian graphs Hsu, Lih-Hsing.
Presentation transcript:

Chapter 5: Globally 3*-connected graphs

Figure 5-1

Figure 5-2

Figure 5-3

Figure 5-4

Recall that a Hamiltonian connected graph is a graph such that there is a path passing through all the vertices between any two vertices. A Hamiltonian graph is a graph such that there are two internal disjoint paths spanning all the vertices between any two vertices (see Figure 5-2, where the blue and green lines together form a Hamiltonian cycle of the graph). In this chapter, we are dealing with graphs with three internal disjoint paths traveling through all the vertices between any given two vertices. We call a graph with k internal disjoint paths spanning all the vertices between any two vertices a k*-connected graph. In particular, a Hamiltonian connected graph is 1*-connected graph and a Hamiltonian graph is a 2*-graph. In this chapter, we are considering cubic 3*-connected graphs. Such graphs are also called globally 3*-connected graphs.

It is interesting to note that every globally 3 It is interesting to note that every globally 3*-connected graph is a 1-fault tolerant Hamiltonian graph. The proof is simple. Figure 5-6

Suppose that some edge is faulty (Figure 5-7).

Since the graph in Figure 5-6 is globally 3 Since the graph in Figure 5-6 is globally 3*-connected, there are three internally disjoint paths between x and y (Figure 5-8). Figure 5-8

Now, we must prove that every globally 3 Now, we must prove that every globally 3*-connected graph is 1-vertex fault tolerant Hamiltonian. Suppose that some vertex is faulty as shown in Figure 5-9. Figure 5-9

Since the graph in Figure 5-6 is globally 3 Since the graph in Figure 5-6 is globally 3*-connected, there are three internally disjoint paths between y and z shown in Figure 5-10. Figure 5-10

3-join. Figure 5-11

Figure 5-12 Figure 5-13

Figure 5-14

Figure 5-15

Figure 5-16 Figure 5-17

Figure 5-18

Any graph G is globally 3*-connected if and only if its vertex expansion is globally 3*-connected.

Figure 5-19

Category 1 consists the set of all cubic Hamiltonian graphs that are Hamiltonian connected, 1-fault tolerant Hamiltonian, and globally 3*-connected. Category 2 consists of the set of all cubic Hamiltonian graphs that are Hamiltonian connected, 1-fault tolerant Hamiltonian, but not globally 3*-connected. Category 3 consists of the set of all cubic Hamiltonian graphs that are not Hamiltonian connected, 1-fault tolerant Hamiltonian, globally 3*-connected. Category 4 consists the set of all cubic Hamiltonian graphs that are not Hamiltonian connected, 1-fault tolerant Hamiltonian, and not globally 3*-connected. Category 5 consists the set of all cubic Hamiltonian graphs that are Hamiltonian connected, not 1-fault tolerant Hamiltonian, and not globally 3*-connected. Category 6 consists the set of all cubic Hamiltonian graphs that are not Hamiltonian connected, not 1-fault tolerant Hamiltonian, and not globally 3*-connected.

All graphs in Category A are in Category 1: cubic Hamiltonian graphs that are Hamiltonian connected, 1-fault tolerant Hamiltonian, and globally 3*-connected. Chapter 4 already showed examples of graphs in Categories 5 (cubic Hamiltonian graphs that are Hamiltonian connected, not 1-fault tolerant Hamiltonian, and not globally 3*-connected) and 6 (cubic Hamiltonian graphs that are not Hamiltonian connected, not 1-fault tolerant Hamiltonian, and not globally 3*-connected). In this chapter, we will give one example each of graphs in Categories 2, 3, and 4.

Figure 5-20 is a graph in category 2: cubic Hamiltonian graphs that are Hamiltonian connected, 1-fault tolerant Hamiltonian, but not globally 3*-connected.. Figure 5-20

We can prove the graph in Figure 5-20 is 1-fault tolerant Hamiltonian and Hamiltonian connected by trial and error. Not globally 3*-connected.

Figure 5-22 is a graph in region 3: cubic Hamiltonian graphs that are not Hamiltonian connected, 1-fault tolerant Hamiltonian, globally 3*-connected. Figure 5-22

Not Hamiltonian connected. Global 3*-connected. Figure 5-23

Figure 5-24 is a region 4 graph: cubic Hamiltonian graphs that are not Hamiltonian connected, 1-fault tolerant Hamiltonian, and not globally 3*-connected. Note that the graph in Figure 5-24 is actually the graph found in Figure 4-39. Thus, it is 1-fault tolerant Hamiltonian but not Hamiltonian connected. Figure 5-24

We can prove that there are not three internal disjoint spanning paths between x and y. Thus, it is not globally 3*-connected. Hence, it is in region 4. However, the proof that “there are not three internal disjoint spanning paths between x and y” is rather tedious. Fortunately, there is an easy proof to show that this graph is not globally 3*-connected. Note that the graph in Figure 5-24 can be obtained by a sequence of vertex expansions of the graph in Figure 5-25. Thus, the graph in Figure 5-24 is globally 3*-connected if and only if the graph in Figure 5-25 is globally 3*-connected. Figure 5-25

Note that any globally 3*-connected graph is 1-fault tolerant Hamiltonian. Suppose that the graph in Figure 5-23 is globally 3*-connected. Suppose that the vertex x in Figure 5-25 is faulty (see Figure 5-26). Figure 5-26

Suggested Reading and Possible Future Directions In [1], Albert, Aldred, Holton and Sheehan first studied cubic graphs with three internal disjoint spanning paths between any pair of vertices. Such graphs are called globally 3*-connected graphs. Later, Kao, Huang, Hsu and Hsu [3] proved that every globally 3*-connected graph is 1-fault tolerant Hamiltonian. Moreover, they proved that there are an infinite numbers of graphs in each region in Figure 5-19. The reader can see the reference section for more information [2].

For possible future directions, we can classify the globally 3 For possible future directions, we can classify the globally 3*-connected property of some families of graphs. For example, in Chapter 2, we introduced the family of generalized Petersen graphs and the family of cube-connected cycles. We can explore the globally 3*-connected property of this family of graphs. It was proven by Albert, M, Aldred, E.R.L., Holton, D., and Sheehan J. [1] that the graph GP(n,1), with n≥3, is globally 3*-connected if and only if n is odd; the graph GP(n,2), with n≥3 is globally 3*-connected if and only if n=1,2, or 3 (mod 6); and the graph GP(n,3), with n≥7, is 3*-connected if and only if n is odd. Recently, it has been proven that the graph P(n,4), with n≥9 is 3*-connected if and only if n≠12 [3]. For cube-connected cycles, we hypothesize that CCCn is globally 3*-connected if and only if n is odd with n  5.

Reference: Albert, M, Aldred, E.R.L., Holton, D., and Sheehan J., On 3*-connected graphs, Australasian Journal of Combinatorics 24 (2001) 193. Hsu, L.H. and Lin, C.K., Graph Theory and Interconnection Networks, CRC Press, 2008. Kao, S.S., Huang, H.M., Hsu, K.M., and Hsu, H.H., Cubic 1-Fault-Tolerant Hamiltonian Graphs, Globally 3*-Connected Graphs, and Super 3-Spanning Connected Graphs, to appear in Ars Combinatorica.

cubic graphs Special families of cubic graphs Regular graphs Special families of regular graphs Examples: Pancake graph Matching composition of Pancake graphs

General graph theory Ore Dirac Chvatal 𝑒≥( 𝑛−1 2 )+2 is Hamiltonian 𝑒≥( 𝑛−1 2 )+3 is Hamiltonian connected

A note on Diameter of Pancake graph

𝑒≥( 𝑛−1 2 )+3 is 1*, 2*, and 3*. 𝑒≥( 𝑛−1 2 )+4 is 1*, 2*, 3*, 4*. etc