Date of Publication

12-1997

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Severino V. Gervacio

Defense Panel Chair

Yolando B. Beronque

Defense Panel Member

Severino D. Diesto
Shirlee R. Remoto

Abstract/Summary

This is a treatise of the article by P. Avery on the condition for a tournament score sequence to be simple. This study establishes the detailed proof of the more important result by giving the basic concepts, definitions, lemmas and theorems with their corresponding proofs and examples. The condition is given for a tournament score sequence to belong to exactly one tournament. The major results is that if a score sequence S is simple then every strong component of S is one of 0, 1,1,1, 1,1,2,2, or 2,2,2,2. Moreover, if every strong component is one of these, then S must be simple.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

TG02711

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

ix, 121 leaves

Keywords

Graph theory; Mathematics--Formulae; Sequences (Mathematics)

Upload Full Text

wf_yes

Download

Share

COinS