Deleting an edge from the connected graph can never ever bring about a graph that has a lot more than two related components. A trail is often described as an open up walk exactly where no edge is permitted to repeat. Within the trails, the vertex is often repeated. The sum-rule talked about h