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 3 of 3 for “"graceful labeling"”.

  1. 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.</p>

    gsu Repository record for Geometric and Algebraic Graphs and their Applications (opens in a new tab)

  2. 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 …

    duquesne Repository record for Common Techniques in Graceful Tree Labeling with a New Computational Approach (opens in a new tab)

  3. Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>.

    <p>A decomposition <em>D</em> of a graph <em>H</em> by a graph <em>G</em> is a partition of the edge set of <em>H</em> such that the subgraph induced by the edges in each part of the partition is isomorphic to <em>G</em>. A <em>mixed graph</em> on <em>V</em> vertices is an ordered pair …

    etsu Repository record for Decompositions of Mixed Graphs with Partial Orientations of the P<sub>4</sub>. (opens in a new tab)