Hamiltonian Properties in Cartesian Product Mei Lu Department of Mathematical Sciences, Tsinghua University, Beijing A joint work with H.J. Lai and H.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Chapter 8 Topics in Graph Theory
Chun-Cheng Chen Department of Mathematics National Central University 1.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Graph-02.
Introduction to Graph Theory Lecture 11: Eulerian and Hamiltonian Graphs.
Small cycle cover of 3-connected cubic graphs Fan Yang ( 杨帆 ) and Xiangwen Li ( 李相文 ) Dep. of Mathematics Huazhong Normal University, Wuhan, China
Discrete Mathematics Transparency No. 8-1 Chapter 8 Trees.
Graph Theory Ming-Jer Tsai. Outline Text Book Graph Graph Theory - Course Description The Topics in the Class Evaluation.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Discrete Structures Chapter 7B Graphs Nurul Amelina Nasharuddin Multimedia Department.
Definition Hamiltonian graph: A graph with a spanning cycle (also called a Hamiltonian cycle). Hamiltonian graph Hamiltonian cycle.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
Graphs and Trees This handout: Eulerian Cycles: Sufficiency of the condition Hamiltonian tour.
Balanced Path Decompositions of Crowns and Directed Crowns Hung-Chih Lee and Shun-Li Hsu Department of Information Technology Ling Tung University Taichung,
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
Costas Busch - RPI1 Mathematical Preliminaries. Costas Busch - RPI2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
Courtesy Costas Busch - RPI1 Mathematical Preliminaries.
Multicolored Subgraphs in an Edge Colored Graph Hung-Lin Fu Department of Applied Mathematics NCTU, Hsin Chu, Taiwan
On sparse Ramsey graphs Torsten Mütze, ETH Zürich Joint work with Ueli Peter (ETH Zürich) TexPoint fonts used in EMF. Read the TexPoint manual before you.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Summing degree sequences work out degree sequence, and sum.
Minimal Fault Diameter for Highly Resilient Product Networks Khaled Day, Abdel-Elah Al-Ayyoub IEEE Trans. On Parallel and Distributed Systems 2000 vol.
1 Edge-bipancyclicity of star graphs under edge-fault tolerant Applied Mathematics and Computation, Volume 183, Issue 2, 15 December 2006, Pages
Euler and Hamilton Paths
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 CS104 : Discrete Structures Chapter V Graph Theory.
Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.
Fall 2005Costas Busch - RPI1 Mathematical Preliminaries.
Prof. Busch - LSU1 Mathematical Preliminaries. Prof. Busch - LSU2 Mathematical Preliminaries Sets Functions Relations Graphs Proof Techniques.
5.2 Trees  A tree is a connected graph without any cycles.
Embedding long paths in k-ary n-cubes with faulty nodes and links
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
A study of k-ordered hamiltonian graphs. Story begins L. Ng, M. Schultz, k-Ordered Hamiltonian graphs, J. Graph Theory 24 (1997) 45–57.
Cyclability in graphs Hao LI CNRS - Université de Paris-sud XI.
1 The 24th Clemson mini-Conference on Discrete Mathematics and Algorithms Oct. 22 – Oct. 23, 2009 Clemson University Algebraic Invariants and Some Hamiltonian.
Mike Jacobson UCD Graphs that have Hamiltonian Cycles Avoiding Sets of Edges EXCILL November 20,2006.
Mutually independent Hamiltonian cycles on Cartesian product graphs Student: Kai-Siou Wu ( 吳凱修 ) Adviser: Justie Su-Tzu Juan 1National Chi Nan University.
Abdollah Khodkar Department of Mathematics University of West Georgia Joint work with: Kurt Vinhage, Florida State University.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Graph Theory Ming-Jer Tsai. Outline Graph Graph Theory Grades Q & A.
1 Mathematical Preliminaries. 2 Sets Functions Relations Graphs Proof Techniques.
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
COMPSCI 102 Introduction to Discrete Mathematics.
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.
Bipartite Kneser graphs are Hamiltonian
Graphs: Definitions and Basic Properties
A study of k-ordered hamiltonian graphs
Discrete Structures – CNS2300
Spanning Trees Discrete Mathematics.
Lecture 15: Graph Theory II
Problem Solving 4.
Mathematical Preliminaries
Miniconference on the Mathematics of Computation
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Hamiltonian Cycles.
Euler and Hamilton Paths
Multicolored Subgraphs in an Edge Colored Graph
Existence of 3-factors in Star-free Graphs with High Connectivity
Discrete Mathematics for Computer Science
Richard Anderson Lecture 5 Graph Theory
Drawing a graph
Presentation transcript:

Hamiltonian Properties in Cartesian Product Mei Lu Department of Mathematical Sciences, Tsinghua University, Beijing A joint work with H.J. Lai and H. Li

Terminology and notation Let G=(V, E) be a simple graph. d G (v): the degree of v in G. Δ(G): the maximum degree of G P m : a path with m vertices (m≥2) C n : a cycle with n vertices (n≥3) K 1,j-1 :a star with j vertices (j≥1)

Cartesian product of G 1 and G 2

Problem

In 1978, W. T. Trotter, Jr. and P. Erdos [J. Graph Theory 2 (1978), no. 2, 137–142;] gave necessary and sufficient conditions for the Cartesian product C n ×C m of two directed cycles to be Hamiltonian. Namely, C n ×C m is Hamiltonian if and only if there exist positive integers d 1 and d 2 such that gcd(d 1, n) = 1 = gcd(d 2,m) and d = d 1 +d 2 where d = gcd(m, n).

Some known results

V.V. Dimakopoulos, L. Palios, A.S. Poulakidas, On the hamiltonicity of the cartesian product, Information Processing Letters 96 (2005) 49–53.

Results (1) Theorem 1 Corollary 2 V. Batagelj and T. Pisanski, Hamiltonian cycles in the Cartesian product of a tree and a cycle, Discrete Math. 38 (1982), no. 2-3, 311– 312.

Lemma

Theorem 1 Sketch of the proof

Results (2) Theorem 3

Results (3) Theorem 4

Lemma

Results (4) Theorem 5

Results (5) Theorem 6

Thank You !