Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Graceful Labeling"”.
-
Geometric and Algebraic Graphs and their Applications
… we investigate a method of finding Super Edge-graceful labeling (SEGL) on graphs. We make an effort to generate infinite families that have a SEGL and continue research to be able to classify graphs into categories of those with a SEGL and those without.
-
Common Techniques in Graceful Tree Labeling with a New Computational Approach
The graceful tree conjecture was first introduced over 50 years ago, and to this day it remains largely unresolved. Ideas for how to label arbitrary trees have been sparse, and so most work in this area focuses on demonstrating that particular classes of trees are graceful. In my research, I …
-
Graceful Kayak Paddles
… m vertices and n edges, then a general vertex labeling of the graph is a one-to-one mapping of the vertex set of G into the set of all non-negative integers. If we have two vertices, say x and y joined by an edge xy, we define the edge length as min{x − y, y − x}, where the subtraction is …
-
Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>.
A decomposition D of a graph H by a graph G is a partition of the edge set of H such that the subgraph induced by the edges in each part of the partition is isomorphic to G. A mixed graph on V vertices is an ordered pair (V,C), where V is a set of vertices, |V| = v, and C is a set of ordered and …