Enumeration of labeled thorn graphs

A thorn graph is a connected graph that becomes smooth after a single removal of end points together with their incident edges. An explicit formula is obtained for the number of labeled thorn graphs with given numbers of vertices and edges, and the corresponding asymptotics is found for the number of such graphs with a large number of vertices. It is proved that with a uniform probability distribution, almost all labeled connected sparse graphs are not thorn graphs.