Distance-balancing of cube-connected cycles graphs
Combinatorics
2024-01-31 v1
Abstract
We show that cube-connected cycles graphs are distance-balanced, and nicely distance-balanced if and only if is even.
Cite
@article{arxiv.2401.16528,
title = {Distance-balancing of cube-connected cycles graphs},
author = {Mokhtar Aouina and Hamed Karami and Douglas J. LaFountain},
journal= {arXiv preprint arXiv:2401.16528},
year = {2024}
}
Comments
10 pages, 3 figures