s不超过6的无标号(n,n/2+s)-奇图的计数

Enumeration of Unlabelled(n,n/2+s)-odd Graphs for s≤6

一个图称为(n,m)-图,若|V(G)|=n且|E(G)|=m.一个奇图是指每个点的度都是奇数的图.给出了一种新的图同构的定义,计算并给出了不同构无标号(n,n/2+5)-奇图的结果,并对s=4,6给出了不同构无标号(n,n/2+s)-奇图的完整结果.

A graph is defined as an（n,m）-graph if｜V（G）｜=n and｜E（G）｜=m.An odd graph is a graph such that every vertex has the odd degree.In this paper,we defined a new graph isomorphism,enumerate and count the nonisomorphic unlabelled odd（n,n/2＋5）-graphs and expand the results on nonisomorphic unlabelled odd（n,n/2＋s）-graphs for s=4,6.