An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line

In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.