New identities from enumeration of graphs

In this paper, three new combinatorial identities related to the enumeration of labeled connected graphs with a given number of endpoints are presented. We give a proof of these identities independent of the enumeration of graphs. For one of the identities, a course of the proof based on formulas for enumerating graphs is outlined.