In this paper we study the optimal information and average information rates of secret sharing schemes which are all connected graphs on six vertices. There are $102$ connected graphs on six vertices that are not complete multipartite graphs. Of these $102$ graphs, we determined the optimal information rate of $71$ graphs, and the optimal average information rate of $88$ graphs.
ATICI, MUSTAFA (2000) "Information and Average Information Rates of a Graphical Access Structure on Six Vertices," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 8: No. 1, Article 4. Available at: https://journals.tubitak.gov.tr/elektrik/vol8/iss1/4