On graceful graphs

Date of Publication

1998

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

This paper presents a pattern of labeling for some special graceful graphs like paths, cycles, complete graphs, complete bipartite graphs and some trees. It also contains a mouse-driven computer program written in C programming language to handle the labeling for more general graceful graphs. Aside from computer programming, this paper is mostly expository in nature. Other findings included in this paper were results from graph addition, graph complementation and subgraph formation. Illustrations were provided to show that the complement of graceful (or non-graceful) graphs need not be graceful (or non-graceful). The same is true for the subgraphs of graceful (or non-graceful) graphs. In graph addition, adding two graceful graphs (or two non-graceful graphs or a graceful and a non-graceful graph) will yield to either a graceful or a non-graceful graph. As a conclusion, performing these graph operations on both graceful and non-graceful graphs does not guarantee the gracefulness and the non-gracefulness of the resulting graph/s. Also, it shows that graceful graphs need not have a unique graceful labeling.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU08288

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

121 leaves

Keywords

Graph theory; Paths and cycles (Graph theory); Trees (Graph theory); Programming (Mathematics); Algorithms

This document is currently not available here.

Share

COinS