Award Date

1-1-2007

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Mathematical Sciences

First Committee Member

Ebrahim Salehi

Number of Pages

60

Abstract

For a graph G = (V, E) and a coloring (labeling) f : V(G) → Z2 let vf(i) = | f-1(i)|. The coloring f is said to be friendly if |vf(1) - v f(0)| ≤ 1. The coloring f : V( G) → Z2 induces an edge labeling f* : E( G) → Z2 defined by f* (xy) = f( x) + f(y) (mod 2). Let ef(i) = |f*-1( i)|. The friendly index set of the graph G, denoted by FI (G), is defined by FIG= ef1-ef 0:f isafriendly vertexlabelingof G. In this thesis the friendly index sets of certain classes of trees, called starlike graphs, will be determined.

Keywords

Friendly; Graphs; Index; Sets; Starlike

Controlled Subject

Mathematics

File Format

pdf

File Size

1372.16 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.

Rights

IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Download


COinS