Decomposition of hypercube graphs into paths and cycles having k edges
For an even graph G and positive integer p, q, and k, the pair (p, q) is an admissible pair if [Formula: see text]. If a graph G admits a decomposition into p copies of [Formula: see text], the path of length k, and q copies of Ck, the cycle of length k, for every admissible pair (p, q), then G has...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2444564 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|