A conjecture on the lower bound of the signed edge domination number of 2-connected graphs

Abstract In this short note, we construct an infinite family of counterexamples to a conjecture on the lower bound of the signed edge domination number of 2-connected graphs. We propose two problems in order to revise the original conjecture.