Yu-Jung Liang Department of Applied Mathematics National Dong Hwa University Advisor: Professor David Kuo.

Slides:

Advertisements

Similar presentations

Secure and Secure-dominating Set of Cartesian Product Graphs

Advertisements

13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.

 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.

Study on Power Domination of Graphs 圖上電力支配問題的研究研究生：莊建成指導教授：張鎮華 Student ： Chien-Cheng Chuang Advisor ： Gerard Jennhwa Chang Department of Mathematics,

Probabilistic Group-Level Motion Analysis and Scenario Recognition Ming-Ching Chang, Nils Krahnstoever, Weina Ge ICCV2011.

Review of Mathematical Notation / Terminology

A tree is a simple graph satisfying: if v and w are vertices and there is a path from v to w, it is a unique simple path. a b c a b c.

CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)

2006 Fall MATH 100 Lecture 141 MATH 100Class 21 Line Integral independent of path.

1 Routing Algorithms. 2 Outline zBellaman-Ford Algorithm zDijkstra Algorithm.

Trees. 2 Definition of a tree A tree is a node with a value and zero or more children Depending on the needs of the program, the children may or may not.

CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

Chapter 9: Graphs Basic Concepts

1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.

Chapter 2 Sets, Relations, and Functions SET OPERATIONS The union of A and B.

Trees and Tree Traversals Prof. Sin-Min Lee Department of Computer Science San Jose State University.

ECE 1100: Introduction to Electrical and Computer Engineering Notes 23 Power in AC Circuits and RMS Spring 2008 David R. Jackson Professor, ECE Dept.

2-3 Geometric Sequences Definitions & Equations

Alias Detection Using Social Network Analysis Ralf Holzer, Bradley Malin, Latanya Sweeney LinkKDD 2005 Advisor: Dr. Koh Jia-Ling Reporter: Che-Wei,

INTRODUCTION TO THE THEORY OF COMPUTATION INTRODUCTION MICHAEL SIPSER, SECOND EDITION 1.

XQuery with User-defined Functions David Bednárek ulita.ms.mff.cuni.cz/~bednarek Department of Software Engineering Faculty.

Lecture 17 Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 20.

03 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

A new linear algorithm for checking a graph for 3-edge-connectivity Feng Sun Advisor: Dr. Robert W. Robinson Committee: Dr. E. Rodney Canfield Dr. Eileen.

2.1 “Relations & Functions” Relation: a set of ordered pairs. Function: a relation where the domain (“x” value) does NOT repeat. Domain: “x” values Range:

1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.

PRODUCT MANAGEMENT Marketing Management Session 6 and 7 October 10 and 17.

Review 1 Polish Notation Prefix Infix Postfix Precedence of Operators Converting Infix to Postfix Evaluating Postfix.

Enumerating kth Roots in the Symmetric Inverse Monoid Christopher W. York Dr. Valentin V. Andreev, Mentor Department of Mathematics October 1, 2014.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Copyright (c) by Daphne Liu and Melanie Xie Radio Numbers for Square Paths & Cycles Daphne Liu & Melanie Xie California State University, Los Angeles Department.

Complete Optimal Deployment Patterns for Full-Coverage and k-Connectivity (k ≦ 6) Wireless Sensor Networks Xiaole Bai, Dong Xuan, Ten H. Lai, Ziqiu Yun,

1 On Channel Assignment Of Graphs Author : Hsin-Ju Wu Adviser : Yung-Ling Lai Speaker : Shr-Jia Hung.

Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.

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.

1 CPSC 320: Intermediate Algorithm Design and Analysis July 14, 2014.

X = 2 + t y = t t = x – 2 t = (y + 3)/2 x – 2 = y x – 4 = y + 3 y – 2x + 7 = 0 Finding the Cartesian Equation from a vector equation x = 2.

COMPSCI 102 Introduction to Discrete Mathematics.

We want to add here all the Eleven schools that are functional. Next slide shows how it would look when we click on School of Studies.

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

L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.

Quantitative Methods of Decision Making EMBA 5207.

Yunus Akkaya Rommy Marquez Heather Urban Marlana Young

Lecture 2: Functions and Graphs

Grade 11 AP Mathematics Graph Theory

Refresh and Get Ready for More

Spanning Trees Discrete Mathematics.

X-STANDARD MATHEMATICS ONE MARK QUESTIONS

Title Goes Here Title Goes Here Title Goes Here Title Goes Here

4-4 Graph Theory Trees.

Chapter 9: Graphs Basic Concepts

Trees L Al-zaid Math1101.

Label Name Label Name Label Name Label Name Label Name Label Name

EDLC(Embedded system Development Life Cycle ).

Discrete Mathematics Lecture 6: Set and Function

Trees 11.1 Introduction to Trees Dr. Halimah Alshehri.

A Introduction to Computing II Lecture 13: Trees

A network problem is one that can be represented by...

Mathematics for Computer Science MIT 6.042J/18.062J

Trees and minimum connector problems

Word Word Word Word Word Picture Definition Historical Significance

Gaph Theory Planar Graphs

Biology WorkBench David Shiuan Department of Life Science,

Chapter 9: Graphs Basic Concepts

Presentation transcript:

Yu-Jung Liang Department of Applied Mathematics National Dong Hwa University Advisor: Professor David Kuo

Outline Introduction Previous Results Main Results

Definition (The Cartesian product)

Definition (Rainbow connection number)

Previous Results back1

back

Main Results Particular labeling

Rainbow connection numbers of the Cartesian product of paths and cycles

Thm 1

Rainbow connection numbers of the Cartesian product of two trees

Thm3