无圈线性同胚k不可约超图的计数  

The Counting Series for Acyclic Linear Homeorphically K Irreducible Hypergraphs

作　　者：黄俊源[1] 

机构地区：[1]华南师范大学教学系,广东广州510631

出　　处：《惠州学院学报》2006年第6期22-26,共5页Journal of Huizhou University

摘　　要：无圈超图的数学模型在计算机科学的关系数据库设计和蜂窝式移动通信系统中具有重要作用。本文运用了Polya计数定理得到了无标号无圈线性同胚k不可约超图的计数公式。The acyclic hypergraph modeling have proven to be a very useful structure in relational databases for computer science. In addition, hypergraph models are very important for cellular mobile communication systems. By applying Polya＇s Enumeration Theorem （PET）, the counting sefiesis derived for acyalic linear homeorphically k irreducible hypergraphs.

关 键 词：超图 无圜线性同胚k不可约超图 线性同胚k不可约超树 二部树 Polya计数定理 

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