Carpathian Journal of Mathematics, Vol. 34, No. 2 (2018), pp. 143-155 (13 pages) In the paper, we extend known results concerning crossing numbers for join of graphs of order six. We give the crossing ...

Abstract In 1981, Alspach conjectured that if 3 ≤ mi ≤ υ, υ is odd and υ(υ − 1)/2 = m1 + m2 + ⋯ + mt, then the complete graph Kυ can be decomposed into t cycles of lengths m1, m2, …, mt respectively; ...

For a long time, researchers have been looking for the sort of task that a quantum computer will be better at doing than a classical computer. Because if a quantum computer shows that it can be ...