A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V. In this case, a balanced incomplete block design can be defined by taking elements of V as objects and elements of B as blocks. Many strongly regular graphs can be design partitioned. The nation of design partitioning is extended to a partitioning by a generalization of block designs called order-free designs. All strongly regular graphs can be partitioned via order-free designs. Order-free designs are used to show the nonexistence of a strongly regular graph with parameters (50,28,18,12). The existence of this graph was previously undecided. A computer algorithm that attempts to construct the adjacency matrix of a strongly regular graph (given a suitable order-free design) is presented. Two appendices related to the algorithm are included. The first lists all parameter sets (n,a,c,d) with n ≤ 50 and a ≠ d that satisfy the standard feasibility conditions for strongly regular graphs. Additional information is included for each set. The second appendix contains adjacency matrices (with the partitioning by cocliques and order-free designs exhibited) for most of the parameter sets in the first appendix. The theoretical development is presented in the context of association schemes. Partitioning by order-free designs extends naturally to any association scheme when cocliques are generalized to {Ø,i} -cliques. This extended partitioning is applied to generalized hexagons.

A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V. In this case, a balanced incomplete block design can be defined by taking elements of V as objects and elements of B as blocks. Many strongly regular graphs can be design partitioned. The nation of design partitioning is extended to a partitioning by a generalization of block designs called order-free designs. All strongly regular graphs can be partitioned via order-free designs. Order-free designs are used to show the nonexistence of a strongly regular graph with parameters (50,28,18,12). The existence of this graph was previously undecided. A computer algorithm that attempts to construct the adjacency matrix of a strongly regular graph (given a suitable order-free design) is presented. Two appendices related to the algorithm are included. The first lists all parameter sets (n,a,c,d) with n ≤ 50 and a ≠ d that satisfy the standard feasibility conditions for strongly regular graphs. Additional information is included for each set. The second appendix contains adjacency matrices (with the partitioning by cocliques and order-free designs exhibited) for most of the parameter sets in the first appendix. The theoretical development is presented in the context of association schemes. Partitioning by order-free designs extends naturally to any association scheme when cocliques are generalized to {Ø,i} -cliques. This extended partitioning is applied to generalized hexagons.

en_US

dc.type

text

en_US

dc.type

Dissertation-Reproduction (electronic)

en_US

dc.subject

Partitions (Mathematics)

en_US

dc.subject

Graph theory.

en_US

thesis.degree.name

Ph.D.

en_US

thesis.degree.level

doctoral

en_US

thesis.degree.discipline

Mathematics

en_US

thesis.degree.discipline

Graduate College

en_US

thesis.degree.grantor

University of Arizona

en_US

dc.identifier.proquest

8504121

en_US

dc.identifier.oclc

693397997

en_US

All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.