Award Date

12-1-2014

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Mathematical Sciences

First Committee Member

Michelle Robinette

Second Committee Member

Arthur Baragar

Third Committee Member

Peter Shiue

Fourth Committee Member

Laxmi Gewali

Number of Pages

50

Abstract

A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1

Keywords

Combinatorial analysis; Combinatorics; Graphical permutations; Graph theory; Permutations; Pi

Disciplines

Discrete Mathematics and Combinatorics | Mathematics

Language

English


Share

COinS