Dynamics of Kth order rational difference equation

Dissertant

Asad, Ayah Zuhayr

Thesis advisor

Salih, Muhammad

Comitee Members

al-Uqayli, Marwan M.
Yusuf, Hasan

University

Birzeit University

Faculty

Faculty of Science

Department

Department of Mathematics

University Country

Palestine (West Bank)

Degree

Master

Degree Date

2010

English Abstract

In 1978 Caccetta and Haggkvist proposed the following conjecture for strict digraphs, which has two forms : the first form is: Let G = (V, E) be a directed graph of order n and girth g such that d + (x) ≥ k for every vertex x.

Then n ≥ K (g-1) + 1.

The second form is : If G is a directed graph with n vertices and if each vertex of G has out degree at least k, then G contains a directed cycle of length at most. Here we investigate two main approaches to prove the conjecture for k ≤ 5 : (1) The first approach is by Hamidoune, which proves the conjecture for k = 3. (2) The second approach is by Hoang and Reed, which proves the conjecture for k ≤ 5.

Main Subjects

Mathematics

No. of Pages

128

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-303575