All good (bad) words consisting of 5 blocks

Autor:	Jian Xin Wei
Rok vydání:	2017
Předmět:	Combinatorics Fibonacci cube 010201 computation theory & mathematics Applied Mathematics General Mathematics 010102 general mathematics 0102 computer and information sciences Hypercube 0101 mathematics 01 natural sciences Graph Mathematics
Zdroj:	Acta Mathematica Sinica, English Series. 33:851-860
ISSN:	1439-7617 1439-8516
DOI:	10.1007/s10114-017-6134-2
Popis:	Generalized Fibonacci cube Qd(f), introduced by Ilic, Klavžar and Rho, is the graph obtained from the hypercube Qd by removing all vertices that contain f as factor. A word f is good if Qd(f) is an isometric subgraph of Qd for all d ≥ 1, and bad otherwise. A non-extendable sequence of contiguous equal digits in a word μ is called a block of μ. Ilic, Klavžar and Rho shown that all the words consisting of one block are good, and all the words consisting of three blocks are bad. So a natural problem is to study the words consisting of other odd number of blocks. In the present paper, a necessary condition for a word consisting of odd number of blocks being good is given, and all the good (bad) words consisting of 5 blocks is determined.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::be2db55d6d5653aeab614b4597547b93 https://doi.org/10.1007/s10114-017-6134-2 Zobrazit plný text záznamu Plný text ve formátu PDF