Graceful labelings and graceful orientations of graphs
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1,...,m which are distinct from each other, such that the absolute values of the differences between adjacent labels are precisely the integers 1,2,...,m.This study introduces a new class of cyclic gra...
Saved in:
Main Author: | |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1999
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/834 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_doctoral-1833 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_doctoral-18332021-05-17T07:51:14Z Graceful labelings and graceful orientations of graphs Fortes, Erminda Castillo A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1,...,m which are distinct from each other, such that the absolute values of the differences between adjacent labels are precisely the integers 1,2,...,m.This study introduces a new class of cyclic graph called flowerette and characterizes those that are graceful. Further, a 3-regular bipartite graceful graph is obtained from flowerettes. It is also shown that the gracefulness/non-gracefulness of graphs obtained from binary operations is not dependent on the gracefulness/non-gracefulness of the graphs involved. Bloom and Hsu extended the concept of graceful graphs to digraphs. Likewise, Gervacio introduced the concept of residually graceful digraphs. In this research, graceful and residually graceful labelings of the oriented star Sm and those of the oriented flowerettes Ftn are investigated. 1999-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_doctoral/834 Dissertations English Animo Repository Graph theory Mappings (Mathematics) Topology Mathematics |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Graph theory Mappings (Mathematics) Topology Mathematics |
spellingShingle |
Graph theory Mappings (Mathematics) Topology Mathematics Fortes, Erminda Castillo Graceful labelings and graceful orientations of graphs |
description |
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1,...,m which are distinct from each other, such that the absolute values of the differences between adjacent labels are precisely the integers 1,2,...,m.This study introduces a new class of cyclic graph called flowerette and characterizes those that are graceful. Further, a 3-regular bipartite graceful graph is obtained from flowerettes. It is also shown that the gracefulness/non-gracefulness of graphs obtained from binary operations is not dependent on the gracefulness/non-gracefulness of the graphs involved. Bloom and Hsu extended the concept of graceful graphs to digraphs. Likewise, Gervacio introduced the concept of residually graceful digraphs. In this research, graceful and residually graceful labelings of the oriented star Sm and those of the oriented flowerettes Ftn are investigated. |
format |
text |
author |
Fortes, Erminda Castillo |
author_facet |
Fortes, Erminda Castillo |
author_sort |
Fortes, Erminda Castillo |
title |
Graceful labelings and graceful orientations of graphs |
title_short |
Graceful labelings and graceful orientations of graphs |
title_full |
Graceful labelings and graceful orientations of graphs |
title_fullStr |
Graceful labelings and graceful orientations of graphs |
title_full_unstemmed |
Graceful labelings and graceful orientations of graphs |
title_sort |
graceful labelings and graceful orientations of graphs |
publisher |
Animo Repository |
publishDate |
1999 |
url |
https://animorepository.dlsu.edu.ph/etd_doctoral/834 |
_version_ |
1772835377754669056 |