Even Harmonious Labelings of Disconnected Graphs
2015-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Even Harmonious Labelings of Disconnected Graphs
Authors
Published Date
2015-05
Publisher
Type
Thesis or Dissertation
Abstract
A graph $G$ with $q$ edges is called \textit{graceful} if there is an injection from the vertices of $G$ to the set $\{0,1,\ldots,q\}$ such that when each edge $xy$ is assigned the label $|f(x)-f(y)|$, the resulting edge labels are distinct. This notion as well as a number of other functions from a graph to a set of non-negative integers were studied as tools for decomposing the complete graph into isomorphic subgraphs. A graph $G$ with $q$ edges is said to be harmonious if there is an injection $f$ from the vertices of $G$ to the group of integers modulo $q$ such that when each edge $xy$ is assigned the label $f(x)+f(y)$ $($mod $q)$, the resulting edge labels are distinct. If $G$ is a tree, exactly one label may be used on two vertices. Over the years, many variations of these two concepts have been studied and hundreds of articles have been written on these topics. We study a variant of harmonious labeling. A function $f$ is said to be an even harmonious labeling of a graph $G$ with $q$ edges if $f$ is an injection from the vertices of $G$ to the integers from $0$ to $2q$ and the induced function $f^*$ from the edges of $G$ to ${0,2,\ldots,2(q-1)}$ defined by $f^*(xy)=f(x)+f(y) ($mod $2q)$ is bijective. Only a few papers have been written on even harmonious labeling. This paper focuses on finding even harmonious labelings for disjoint graphs. Among the families we investigate are: the disjoint union of cycles and stars, unions of cycles with paths, and unions of squares of paths.
Description
University of Minnesota M.S. thesis. May 2015. Major: Applied and Computational Mathematics. Advisor: Joseph Gallian. 1 computer file (PDF); v, 72 pages.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Stewart, Danielle. (2015). Even Harmonious Labelings of Disconnected Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/174719.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.