Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs that arise from 2-weight codes. One of these new graphs is geometric and yields a partial geometry with parameters pg(5, 5, 2) that is not isomorphic to the partial geometry discovered by J. H. van Lint and A. Schrijver [13] in 1981
2014 Summer.There are many open problems concerning strongly regular graphs: proving non-existence f...
The use of partial geometries to construct parity-check matrices for LDPC codes has resulte...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
We give some new representations of the partial geometry pg(6, 6, 2), which was constructed by van L...
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vert...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
AbstractThe possible existence of 16 parameter sets for strongly regular graphs with 100 or less ver...
We provide an alternative construction of the strongly regular graphs associated with the two sporad...
AbstractWe give some new representations of the partial geometry pg(6, 6, 2), which was constructed ...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
2014 Summer.There are many open problems concerning strongly regular graphs: proving non-existence f...
The use of partial geometries to construct parity-check matrices for LDPC codes has resulte...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...
Twelve new strongly regular graphs with parameters (81, 30, 9, 12) are found as graphs invariant und...
We give some new representations of the partial geometry pg(6, 6, 2), which was constructed by van L...
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vert...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractWe construct new linear two-weight codes over the finite field with q elements. To do so we ...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, h1,...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
AbstractThe possible existence of 16 parameter sets for strongly regular graphs with 100 or less ver...
We provide an alternative construction of the strongly regular graphs associated with the two sporad...
AbstractWe give some new representations of the partial geometry pg(6, 6, 2), which was constructed ...
If s is an even power of a prime and t equals s or ss, we show the existence of pseudo-geometric str...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
2014 Summer.There are many open problems concerning strongly regular graphs: proving non-existence f...
The use of partial geometries to construct parity-check matrices for LDPC codes has resulte...
Since the ancient determination of the five platonic solids the study of symmetry and regularity has...