Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
One of the important issues in evaluating an interconnection network is to study the hamiltonian cycle embedding problems. A graph <i>G</i> is spanning <i>k</i>-edge-cyclable if for any <i>k</i> independent edges <inline-formula><math xmlns="http://w...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-09-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/12/9/861 |