Disconnected Complements of Steinhaus graphs

Autor:	Matthew Koerlin, Jean-Guy Speton, Tom Whaley, Wayne M. Dymacek, Jennifer Yanulavich
Rok vydání:	2002
Předmět:	Combinatorics Discrete mathematics Applied Mathematics Discrete Mathematics and Combinatorics Upper and lower bounds Graph Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 11:218-232
ISSN:	1571-0653
DOI:	10.1016/s1571-0653(04)00067-8
Popis:	In 1976 Molluzzo asked for the conditions on a generating string of a Steinhaus graph that would guarantee that its complement would be connected. In this paper we give conditions that guarantee that the complement is not connected and a recursion, for the number of such strings. We also find tight upper and lower bounds for this recursion by examining the recursion d σ (2 k ) = d σ ( k )+ d σ ( k −1) and d σ (2 k +1) = 2 d σ ( k ) + 1.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::126f355cca0d24bc4875e5184c590aac https://doi.org/10.1016/s1571-0653(04)00067-8 Zobrazit plný text záznamu Full Text from ScienceDirect