Name
Abstract | ||
|---|---|---|
Let f be a binary word and n≥1. Then the generalized Lucas cube Qn(f↽) is the graph obtained from the n-cube Qn by removing all vertices that have a circulation containing f as a factor. Ilić, Klavžar and Rho solved the question for which f and n, Qn(f↽) is an isometric subgraph of Qn for all binary words of length at most five. This question is further studied in this paper. For an isometric word f, sufficient and necessary conditions of Qn(f↽) being an isometric subgraph of Qn are found, and two problems on generalized Lucas cubes are also listed. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2020.112024 | Discrete Mathematics |
Keywords | DocType | Volume |
Generalized Lucas cube,Generalized Fibonacci cube,Isometric word | Journal | 343 |
Issue | ISSN | Citations |
10 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianxin Wei | 1 | 12 | 2.65 |
| Yujun Yang | 2 | 24 | 4.05 |
| Guangfu Wang | 3 | 1 | 2.05 |