简单无向不同构图的计数通式  

A General Method for Counting Different Isomorphic Graphs

作　　者：周学松[1] 金衍义[1] 邱灵素[1] 

机构地区：[1]浙江工商大学统计与数学学院,浙江杭州310015

出　　处：《华东交通大学学报》2009年第5期97-102,共6页Journal of East China Jiaotong University

基　　金：浙江工商大学资助项目(3120XJ030307)

摘　　要：简单无向不同构图的计数问题是一个十分困难的问题,利用生成群对点集合的二元子集的作用所得的轨道数,给出了计算由点所组成的简单无向不同构图的总数的通解公式。It is difficult to count different isomorphic graph. In this paper, the effect of generated subgroup on the state set of dualistic point subset of n points is studied and then used to solve the number of orbits, which finally helps formulate the number of different isomorphic graphs composed of n points.

关 键 词：同构 对称群 BURNSIDE引理 轨道 不动点 

分 类 号：O157.1[理学—数学]