ENUMERATION OF LABELLED CONNECTED GRAPHS AND EULER GRAPHS WITH ONLY ONE CUT VERTEX
Yinglie Jin · Institutional Repositories DataBase (IRDB) · 1998
This paper is concerned with the enumeration of labelled graphs with only one cut vertex. In this paper we give the exponential generating functions for labelled connected graphs and Euler graphs having exactly ＄n＄ blocks at the cut vertex. The numerical tables are also given.