clique

In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

The line graph $$L(G)$$ of a simple graph $$G$$ is defined as follows: $$\,\,\,\,$$There is exactly one vertex $$v(e)$$ in $$L$$(G)$$ for each edge $$e$$ in $$G$$ $$\,\,\,\,$$ For...