NDLTD logo NDLTD Union Catalog and Global ETD Search

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 8 of 8 for “"strongly regular graphs"”.

  1. On the $p$-rank of the adjacency matrices of strongly regular graphs

    van Eijl, C.A.1991

    eindhoven Repository record

  2. Algebraic methods in graph theory

    Li, WeiqiangUniversity of Delaware2015

    … in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture …

    udel Repository record

  3. Graph Isomorphism Algorithms Based on Trees and Paths.

    Dean, Susan Thorpe

    … for testing isomorphism of two classes of graphs: the strongly regular graphs, which have been difficult for many previous isomorphism algorithms to process, and the compact graphs (graphs with diameter of 2 whose complements also have diameter of 2).The strongly regular graphs algorithm is …

    uab Repository record

  4. Subconstituent Algebras of Latin Squares

    Daqqa, IbtisamDigital Commons @ University of South Florida2007

    … scheme. One also may construct several strongly regular graphs on the positions of a Latin square, where adjacency corresponds to any subset of the nonidentity relations described above. We describe the local spectrum and subconstituent algebras of such strongly regular graphs. Finally, …

    usf Repository record

  5. Applications of Schur rings in algebraic combinatorics: graphs, partial difference sets and cyclotomic schemes

    Heinze, AisoUniversität Oldenburg

    … considered: (1) characterization of commuting graphs, (2) consideration of strongly regular graphs and partial difference sets and (3) investigation of cyclotomic schemes. The first part deals with graphs with commuting adjacency matrices. Here, we give results for commuting regular graphs and …

    oldenburg Repository record

  6. Benson's Theorem for Partial Geometries

    Kamischke, Ellen J.

    mtu Repository record

  7. Hyperovals, Laguerre planes and hemisystems - an approach via symmetry

    Bayens, Luke, author, Penttila, Tim, advisor, Achter, Jeff, committee member, Bohm, Willem, committee member, Peterson, Chris, committee memberColorado State University. Libraries2013

    … to other combinatorial structures, such as strongly regular graphs, partial quadrangles, and association schemes. In 2005, Cossidente and Penttila constructed a family of hemisystems in H(3,q2), q odd, and in 2009, the same authors constructed a family of hemisystem in H(5,q2), q odd. We …

    colostate Repository record

  8. Source modulated multiplexed hyperspectral imaging: Theory, hardware and application

    Streeter, LeeThe University of Waikato2009

    … The link between Hadamard matrices with strongly regular graphs is extended to incorporate all three types of Hadamard matrices. The effect of the number of measurements used in compressed sensing on measurement precision is derived by inference using results concerning the eigenvalues of …

    waikato-masters Repository record