Enumeration of unlabelled graphs with specified degree parities Original Research Article

This paper gives a generating function for unlabelled graphs of order n. The coefficient of each monomial in this function shows the number of unlabelled graphs with given size and the number of odd vertices. Furthermore, the numerical examples are given for 1⩽n⩽9.