One-Node One-Edge Dimension-Balanced Hamiltonian Problem on Toroidal Mesh Graph
Given a graph <i>G</i> = (<i>V</i>, <i>E</i>), the edge set can be partitioned into <i>k</i> dimensions, for a positive integer <i>k</i>. The set of all <i>i</i>-dimensional edges of <i>G</i> is a subset of <i>...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Engineering Proceedings |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2673-4591/89/1/17 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|