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 “"Strongly regular graph"”.
-
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
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 …
-
On strongly regular graphs
Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular if its adjacency matrix has exactly three …
-
Detailing the Connection Between a Family of Polar Graphs and Tremain Equiangular Tight Frames
The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of …
-
On the analysis of SRG(85, 14, 3, 2)
… unresolved feasible set of parameters of strongly regular graphs, (v,k,λ,µ) = (85,14,3,2). We start with the general properties of the 34dimensional Euclidean representation of such a graph G, and then focus on the special subgraphs called segments, which are edge complements in the local …
-
New constructions of strongly regular graphs
There are 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 …
-
Some topics in the theory of finite groups
<p>A regular 2-graph consists of a set andOmega; together with a (non-empty) set <em>t</em> of three-element subsets of andOmega; such that any two-element subset of andOmega; is contained in the same number of elements of <em>t</em>, any four-element subset of andOmega; contains an even number of …
-
Fusions of association schemes
… its initial introduction, many algebraists and graph theorists have been studying the existence, construction and generalizations of various association schemes [1, 3, 7, 8, 17, 19, 28, 29, 30]. Because of their impressive construction, association schemes are useful to these subjects and there …
-
Some results on partial difference sets and partial geometries
This thesis shows results on 3 different problems involving partial difference sets (PDS) in abelian groups, and uses PDS to study partial geometries with an abelian Singer group. First, the last two undetermined cases of PDS on abelian groups with k ≤ 100, both of order 216, were shown not to …
-
Subconstituent Algebras of Latin Squares
… 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, …