圈数不超过4的圈图中最大解离集极值问题研究  

Study on the Problem of the Extreme Value of the Maximum Dissociation set in the Circle Graph with the Number of Circles not Exceeding 4

作　　者：徐达黄 耿显亚 XU Dahuang;GENG Xianya(Anhui University of Science and Technology,Huainan 232001,China)

机构地区：[1]安徽理工大学数学与大数据学院,安徽淮南232001

出　　处：《牡丹江师范学院学报(自然科学版)》2025年第1期8-12,共5页Journal of Mudanjiang Normal University:Natural Sciences Edition

基　　金：国家自然科学基金项目(12171190);安徽省自然科学基金项目(2008085MA01)。

摘　　要：研究相同阶数圈且圈的个数不超过4的圈图中最大解离集极值问题,得出对应最大解离数的解离集极值.研究结果表明,圈图中圈与圈之间的识别顶点一定不在最大解离集中,否则达不到最大解离集.The extreme value of the maximum dissociation set in a circle graph with the same number of circles and the number of circles not exceeding 4 is studied,and the extreme value of the dissociation set corresponding to the maximum dissociation number is obtained.The results show that the identified vertices between circles in the circle graph must not be in the maximum dissociation set,otherwise the maximum dissociation set cannot be reached.

关 键 词：解离数 最大解离集 圈图 极值 

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