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 20 of 29 for “"strongly regular graphs"”.
-
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 …
-
Quantum Walks on Strongly Regular Graphs
… the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We begin by finding the eigenvalues of …
-
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 …
-
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 …
-
Graph Isomorphism Algorithms Based on Trees and Paths.
… 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 …
-
Classification of small class association schemes coming from certain combinatorial objects
… study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several …
-
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 …
-
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, …
-
Benson's Theorem for Partial Geometries
… values of α. Finally the theorem is extended to strongly regular graphs in Chapter 5. In addition we obtain expressions for the multiplicities of the eigenvalues of matrices related to the adjacency matrices of these graphs. Finally, a four lesson high school level enrichment unit is included to …
-
MAXIMAL ARCS, ABOVE AND BEYOND
… construct two-weight codes, partial geometries, strongly regular graphs and LDPC codes; a review on how to generalize maximal arcs to higher dimensions through Perp-Systems; and an effort in finding constructions of new Perp-Systems.
-
Spherical two-distance sets and related topics in harmonic analysis
… between two-distance tight frames and certain strongly regular graphs. This allows us to use spectral properties of strongly regular graphs to construct two-distance tight frames. Several new examples are obtained using this characterization. Bannai, Okuda, and Tagami proved that a tight …
-
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 …
-
Decomposition of complete designs
… Group divisible designs, symmetric designs, strongly regular graphs, and association schemes are examples of the combinatorial objects that complete designs are decomposed into. Reconstructing McFarland designs leads to the existence of sets of designs with disjoint incidence matrices whose …
-
On highly regular digraphs
<p>We explore directed strongly regular graphs (DSRGs) and their connections to association schemes and finite incidence structures. More specically, we study flags and antiflags of finite</p> <p>incidence structures to provide explicit constructions of DSRGs. By using this connection between the …
-
Biangular vectors
… used to generate combinatorial objects such as strongly regular graphs and association schemes.
-
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 …
Page 1 of 2