Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Song, Sung Yell"'
Autor:
Benjamin, Nathaniel, Song, Sung Yell
An infinite family of association schemes obtained from the general unitary groups acting transitively on the sets of isotropic vectors in the finite unitary spaces are investigated. We compute the parameters and determine the character tables for al
Externí odkaz:
http://arxiv.org/abs/2407.20517
Autor:
Song, Sung-Yell, Tranel, Theodore
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 in the classification of designs in some extent. An ordinary 2-$(v,k,
Externí odkaz:
http://arxiv.org/abs/2106.11047
Autor:
Breen, Jane, Butler, Steve, Fuentes, Melissa, Lidický, Bernard, Phillips, Michael, Riasanovksy, Alexander W. N., Song, Sung-Yell, Villagrán, Ralihe R., Wiseman, Cedar, Zhang, Xiaohong
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\pm1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard matrix and the graph is said to be Hadamard diagonalizable. In this artic
Externí odkaz:
http://arxiv.org/abs/2007.09235
Autor:
Brimkov, Boris, Duna, Ken, Hogben, Leslie, Lorenzen, Kate, Reinhart, Carolyn, Song, Sung-Yell, Yarrow, Mark
The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\mathcal{D}(G)$, where $T(G)$ is the diagonal matrix of row sums of $\ma
Externí odkaz:
http://arxiv.org/abs/1812.05734
Autor:
Abiad, Aida, Brimkov, Boris, Erey, Aysel, Leshock, Lorinda, Martínez-Rivera, Xavier, O, Suil, Song, Sung-Yell, Williford, Jason
Publikováno v:
Discrete Applied Mathematics, 230 (2017), 1-10
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral graphs wi
Externí odkaz:
http://arxiv.org/abs/1609.06911
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 methods for directed strongly regular graphs. The directed strongly re
Externí odkaz:
http://arxiv.org/abs/1311.0494
Autor:
Song, Sung‐Yell1 (AUTHOR) sysong@iastate.edu, Tranel, Theodore1 (AUTHOR)
Publikováno v:
Journal of Combinatorial Designs. Jun2022, Vol. 30 Issue 6, p420-460. 41p.
Autor:
Abiad, Aida, Brimkov, Boris, Erey, Aysel, Leshock, Lorinda, Martínez-Rivera, Xavier, O, Suil, Song, Sung-Yell, Williford, Jason
Publikováno v:
In Discrete Applied Mathematics 30 October 2017 230:1-10
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.