Bubble-sort star graphs BS_n are edge-bipancyclic for n≥3, with every edge on at least four cycles of each even length l from 4 to n!.
O ´Hallaron, Uniform approach for solving some classical problems on a linear array, IEEE Transactions on Parallel and Distributed Systems 2(2)(1991) 236-241
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Edge-bipancyclicity of bubble-sort star graphs
Bubble-sort star graphs BS_n are edge-bipancyclic for n≥3, with every edge on at least four cycles of each even length l from 4 to n!.