6 citations · 16 across the 9 of their papers we have counts for
10 papers
Partial geometric designs having circulant concurrence matrices
Sung-Yell Song, Theodore Tranel
We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…
Graphs that are cospectral for the distance Laplacian
Boris Brimkov, Ken Duna, Leslie Hogben +4
The distance matrix of a graph is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\m…
On the Wiener index, distance cospectrality and transmission regular graphs
Aida Abiad, Boris Brimkov, Aysel Erey +5
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are -cospectral if their distance matrices have the…
Links between orthogonal arrays, association schemes and partial geometric designs
Kathleen Nowak, Oktay Olmez, Sung Y. Song
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial…
Construction of Directed Strongly Regular Graphs Using Block Matrices
Francis Adams, Alexandra Gendreau, Oktay Olmez +1
The concept of directed strongly regular graphs was introduced by Duval in his paper, A Directed Graph Version of Strongly Regular Graphs. Duval also provided several construction…