Distance-balancing of cube-connected cycles graphs
Abstract
We show that cube-connected cycles graphs CCCn are distance-balanced, and nicely distance-balanced if and only if n is even.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.