An Enumeration of Graphical Designs

Details An Enumeration of Graphical Designs An Enumeration of Graphical Designs

2007-12-23

arxiv.org/abs/0712.3895v1

Journal of Combinatorial Designs, vol. 16, no. 1, pp. 70-85, 2008

Mathematics

Combinatorics

16 pages

Scientific paper

10.1002/jcd.20137

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain conditions. The exact determination of $\Psi(t,k)$ for specified $t$ and $k$ is a hard problem and only $\Psi(2,3)$, $\Psi(2,4)$, $\Psi(3,4)$, $\Psi(4,5)$, and $\Psi(5,6)$ have been determined. In this paper, we determine completely the sets $\Psi(2,5)$ and $\Psi(3,5)$. As a result, we find more than 270000 inequivalent graphical designs, and more than 8000 new parameter sets for which there exists a graphical design. Prior to this, graphical designs are known for only 574 parameter sets.

Affiliated with

Also associated with

No associations

Rating

An Enumeration of Graphical Designs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Enumeration of Graphical Designs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Enumeration of Graphical Designs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36202