This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk,29 No. 6, 84–154 (1974).
F. Harary and E. Palmer, Graphical Numeration, Academic Press (1973).
E. Beckenbach (ed.), Applied Combinatorial Mathematics, Wiley (1964).
F. Harary, Graph Theory, Addison-Wesley (1969).
V. A. Popov, I. T. Skibenko, and N. G. Moklyak, “Number of types of systems of k-valued logical functions,” Kibernetika, No. 6, 18–27 (1973).
V. A. Popov and I. T. Skibenko, “Enumeration of automata,” Avtomat. Telemekh., No. 1, 143–148 (1975).
V. A. Popov and I. T. Skibenko, “Supplementability of types of k-valued logical functions,” Izv. Akad. Nauk SSSR. Tekh. Kibernetika, No. 1, 201–206 (1979).
M. A. Harrison, “On the number of classes of binary matrices,” IEEE Trans. Comput.,22, No. 12, 1048–1052 (1973).
K. Bogart and J. Gordon, “Hypergraphs, characteristic polynomials and permutation characters,” Linear and Multilinear Algebra,7, No. 3, 213–236 (1979).
M. A. Harrison, Introduction to Switching and Automata Theory, McGraw-Hill, New York (1965).
V. A. Popov, É. V. Lysenko, and I. T. Skibenko, “Enumeration of types of subdefinite Boolean functions,” Avtomat. Sist. Upr. Pribory Avtomatiki No. 31, 59–65 (1974).
Additional information
Translated from Kibernetika, No. 2, pp. 1–4, 13, March–April, 1984.
Rights and permissions
About this article
Cite this article
Skibenko, I.T. Enumeration of hypergraphs. I. Cybern Syst Anal 20, 167–172 (1984). https://doi.org/10.1007/BF01069170
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069170