Edge-pancyclicity of twisted cubes

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

28 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationAlgorithms and Computation
Subtitle of host publication16th International Symposium, ISAAC 2005, Proceedings
PublisherSpringer Verlag
Pages1090-1099
Volume3827 LNCS
ISBN (Print)3540309357, 9783540309352
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3827 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Title16th International Symposium on Algorithms and Computation, ISAAC 2005
PlaceChina
CityHainan
Period19 - 21 December 2005

Abstract

Twisted cubes are attractive alternatives to hypercubes. In this paper, we study a stronger pancyclicity of twisted cubes. We prove that the n-dimensional twisted cube is edge-pancyclic for n ≥ 3. That is, for any (x, y) ∈ E(TQn)(n ≥ 3) and any integer l with 4 ≤ l ≤ 2n, a cycle C of length l can be embedded with dilation 1 into TQn such that (x, y) is in C. It is clear that an edge-pancyclic graph is also a node-pancyclic graph. Therefore, TQn is also a node-pancyclic graph for n ≥ 3. © Springer-Verlag Berlin Heidelberg 2005.

Citation Format(s)

Edge-pancyclicity of twisted cubes. / Fan, Jianxi; Lin, Xiaola; Jia, Xiaohua et al.

Algorithms and Computation: 16th International Symposium, ISAAC 2005, Proceedings. Vol. 3827 LNCS Springer Verlag, 2005. p. 1090-1099 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3827 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review