Enumeration of labelled graphs with specified degree parities

被引：3

作者：

Nara, C

Tazawa, S

机构：

[1] Tennessee Meiji Acad, Dept Math, Sweetwater, TN 37874 USA

[2] Kinki Univ, Fac Sci & Technol, Dept Math, Osaka 577, Japan

来源：

DISCRETE MATHEMATICS | 1998年 / 183卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(97)00058-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 less than or equal to n less than or equal to 9.

引用

页码：255 / 264

页数：10