有界简单格的不可比图的亏格  

Genus of the Incomparability Graph of a Bounded Simple Lattice

作　　者：罗士峰 邓贵新 黄春红 LUO Shi-feng;DENG Gui-xing;HUANG Chun-hong(School of Mathematical and Statistics,Nanning Normal University,Nanning 530100,China)

机构地区：[1]南宁师范大学数学与统计学院,广西南宁530100

出　　处：《南宁师范大学学报（自然科学版）》2021年第2期19-26,共8页Journal of Nanning Normal University：Natural Science Edition

基　　金：国家自然科学基金项目(11801104,11961050);广西自然科学基金项目(2020GXNSFAA159103,2020GXNSFAA159053)。

摘　　要：一个格的不可比图以它的除最大元和最小元外的元素为顶点,两个不同的顶点相连当且仅当两者不可比.该文确定了不可比图的亏格分别为0,1,2的有界简单格的结构.The incomparability graph of a lattice L is a graph whose vertices are the elements of L other than 0 and 1,and two distinct vertices are adjacent if and only if they are incomparable.In this paper,we mainly study the genus of incomparability graphs of simple lattices with bounded,and completely determine the structure of simple lattices with bounded whose incomparability graphs have genus 0,1,and 2,respectively.

关 键 词：有界简单格 不可比图 平面图 亏格 完全多部图 

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