Sufficient conditions for Hamiltonicity in multiswapped networks
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 105976
- Type
- D - Journal article
- DOI
-
10.1016/j.jpdc.2016.10.015
- Title of journal
- Journal of Parallel and Distributed Computing
- Article number
- -
- First page
- 17
- Volume
- 101
- Issue
- -
- ISSN
- 07437315
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2016
- URL
-
http://dx.doi.org/10.1016/j.jpdc.2016.10.015
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- We show how the Hamiltonicity of multiswapped networks, i.e., interconnection networks formed combinatorially from two seed graphs G and H, can be derived by reducing the problem to determining the Hamiltonicity of a three-dimensional torus with edge faults (no matter what G and H are). This laid the foundations for an extended algebraic framework involving classes of Cayley graphs of semidirect products of abelian groups that encompasses multiswapped networks and faulty tori (I.A. Stewart, Using semidirect products of groups to build classes of interconnection networks, Disc. App. Math. DOI: 10.1016/j.dam.2019.12.014).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -