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 6 of 6 for “"Paley graphs"”.

  1. On the clique number of Paley graphs and generalized Paley graphs

    … upper and lower bounds for the clique number of Paley graphs and generalized Paley graphs is an old and open problem in additive combinatorics. In this thesis, we use polynomial methods, together with various tools from number theory, graph theory, and combinatorics, to study this problem. …

    ubc Repository record for On the clique number of Paley graphs and generalized Paley graphs (opens in a new tab) Download PDF for On the clique number of Paley graphs and generalized Paley graphs (opens in a new tab)

  2. Paley Graphs, Prime Graphs, and Crossword Puzzles

    … concepts. We will prove theorems about Paley graphs, prime graphs, and crossword puzzles. It will be very fun. The results in the section about Paley graphs include structure theorems about the subgraph induced by the quadratic residues, the subgraph induced by the non-residues and a few …

    vcu Repository record for Paley Graphs, Prime Graphs, and Crossword Puzzles (opens in a new tab)

  3. Self-Complementary Arc-Transitive Graphs and Their Imposters

    … families of self-complementary arc-transitive graphs: the familiar Paley graphs and the newly discovered Peisert graphs. After studying both families, we examine a result of Peisert which proves the Paley and Peisert graphs are the only self-complementary arc transitive graphs other than one …

    waterloo Repository record for Self-Complementary Arc-Transitive Graphs and Their Imposters (opens in a new tab)

  4. Self-Dual Graphs

    … on constructing and classifying all self-dual graphs and in particular polyhedra. We will give an overview of the recent research in the first two chapters. In the third chapter, we will show the necessary condition that a self-complementary self-dual graph have <i>n</i> ≡ 0, 1 (mod 8) vertices …

    waterloo Repository record for Self-Dual Graphs (opens in a new tab)

  5. New constructions of strongly regular graphs

    … many open problems concerning strongly regular graphs: proving non-existence for parameters where none are known; proving existence for parameters where none are known; constructing more parameters where examples are already known. The work addressed in this dissertation falls into the last two …

    colostate Repository record for New constructions of strongly regular graphs (opens in a new tab)

  6. Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs

    We consider graphs with the n-existentially closed adjacency property. For a positive integer n, a graph is n-existentially closed (or n-e.c.) if for all disjoint sets of vertices A and B with \A∪ B\ = n (one of A or B can be empty), there is a vertex 2 not in A∪B joined to each vertex of A and no …

    wilfrid-laurier Repository record for Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs (opens in a new tab) Download PDF for Computational and Theoretical Aspects of <em>N</em>-E.C. Graphs (opens in a new tab)