Output details
11 - Computer Science and Informatics
University of Durham
Article title
Bipanconnectivity and bipancyclicity in k-ary n-cubes.
Type
D - Journal article
Title of journal
IEEE Transactions on Parallel and Distributed Systems
Article number
-
Volume number
20
Issue number
1
First page of article
25
ISSN of journal
1045-9219
Year of publication
2009
Number of additional authors
1
Additional information
<13>The techniques established in our paper have been subsequently widely used, e.g., in [J. Li, S. Wang, D. Liu and S. Lin, Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges, Information Sciences, 181 (11) (2011) 2260–2267], the authors expressly state that their primary motivation is our paper (and go on to extend our results to include faults); and in [S. Wang, Y. Yang, J. Li and S. Lin, Hamiltonian cycles passing through linear forests in k-ary n-cubes, Discrete Applied Mathematics 159 (2011) 1425–1435] proof techniques from our paper are explicitly used (see, e.g., Lemma 2.4).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Algorithms and Complexity Research Group
Citation count
24
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
