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 9 of 9 for “"Graph labelings"”.

  1. Graph Labelings

    Given an ordering of the vertices of a graph around a circle, a page is a collection of edges forming non-crossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. The pagenumber t (G) is the minimum number of pages in a book …

    uiuc Repository record for Graph Labelings (opens in a new tab)

  2. Graph Labelings and Tournament Scheduling

    … with distance magic and distance antimagic labelings and their relation to tournament scheduling. Roughly speaking, the relation is as follows. Let the vertices on the graph represent teams in a tournament, and let an edge between two vertices a and b represent that team a will play team b …

    umn Repository record for Graph Labelings and Tournament Scheduling (opens in a new tab)

  3. A SURVEY OF DISTANCE MAGIC GRAPHS

    … this report, we survey results on distance magic graphs and some closely related graphs. A distance magic labeling of a graph G with magic constant k is a bijection l from the vertex set to {1, 2, . . . , n}, such that for every vertex x Σ l(y) = k,y∈NG(x) where NG(x) is the set of vertices of G …

    mtu Repository record for A SURVEY OF DISTANCE MAGIC GRAPHS (opens in a new tab)

  4. Label propagation for classification and ranking

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 2007

    msu Repository record for Label propagation for classification and ranking (opens in a new tab)

  5. Enumeration of general cubic graphs

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2000

    msu Repository record for Enumeration of general cubic graphs (opens in a new tab)

  6. Complexity constrained design of sparse graph codes

    … for the design of capacity-approaching sparsegraph codes, under the assumption of an arbitrary number of decoder iterations. Howeverin many practical situations, latency requirements or hardware constraints maylimit the available number of iterations. This thesis develops methodologies for the …

    adelaide Repository record for Complexity constrained design of sparse graph codes (opens in a new tab)

  7. Investigation of 4-cutwidth critical graphs

    … characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)

  8. Investigation of 4-cutwidth critical graphs

    … characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb-retro Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)