dc.contributor.author |
DiGennaro, Dana Lyn. |
en_US |
dc.contributor.author |
Youngstown State University. Dept. of Mathematics. |
en_US |
dc.date.accessioned |
2011-01-31T14:19:55Z |
|
dc.date.accessioned |
2019-09-08T02:32:57Z |
|
dc.date.available |
2011-01-31T14:19:55Z |
|
dc.date.available |
2019-09-08T02:32:57Z |
|
dc.date.created |
2001 |
en_US |
dc.date.issued |
2001 |
en_US |
dc.identifier.other |
b19446743 |
en_US |
dc.identifier.uri |
http://jupiter.ysu.edu/record=b1944674 |
en_US |
dc.identifier.uri |
http://hdl.handle.net/1989/6300 |
|
dc.description |
iv, 39 leaves ; 29 cm. |
en_US |
dc.description |
Thesis (M.S.)--Youngstown State University, 2001. |
en_US |
dc.description |
Includes bibliographical references (leaves 38-39). |
en_US |
dc.description.abstract |
A vertex labeling of a graph G is an assignment f of labels to the vertices of G.
Each edge xy is assigned a label depending on the vertex labels f (x) and f (y). One
of the best known type of labeling methods is called graceful labeling. A function f
is called a graceful labeling of a graph G with m edges if f is an injection from the
vertices of G to the set {a, 1, ... ,m} such that, when each edge xy is assigned the
label If(x) - f(y)l, the resulting edge labels are distinct. Over the past few decades,
several different graphs have been gracefully labeled.
Another popular labeling method is harmonious labeling. A function f is called a
harmonious labeling of a graph G with m edges if it is an injection from the vertices
of G to the group of integers modulo m such that when each edge xy is assigned the
label (J(x) + f(y)) (mod m), the resulting edge labels are distinct. If the graph G
is a tree or has components that are trees, then exactly one label may be used on
two vertices. In this case f would not be an injection. In this thesis, we present a
technique for labeling the disjoint union of the path and some cycles. We use both
labeling methods, graceful and harmonious. |
en_US |
dc.description.statementofresponsibility |
by Dana Lyn DiGennaro. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.relation.ispartofseries |
Master's Theses no. 0736 |
en_US |
dc.subject.classification |
Master's Theses no. 0736 |
en_US |
dc.subject.lcsh |
Graph labelings. |
en_US |
dc.title |
Graceful and harmonious labeling of the disjoint union of certain cycles and paths / |
en_US |
dc.type |
Thesis |
en_US |