检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李亚宁 刘彬 邓梓健 王丽煊 火博丰 尹君 LI Ya-ning;LIU Bin;DENG Zi-jian;WANG Li-xuan;HUO Bo-feng;YIN Jun(College of Mathematics and Statistics,Qinghai Normal University,Xining 810008,China;Key Laboratory of the Internet of Things of Qinghai Province,Xining 810008,China)
机构地区:[1]青海师范大学数学与统计学院,青海西宁810008 [2]青海省物联网重点实验室,青海西宁810008
出 处:《内蒙古师范大学学报(自然科学版)》2022年第5期540-544,共5页Journal of Inner Mongolia Normal University(Natural Science Edition)
基 金:国家自然科学基金资助项目(11961055,11801296)。
摘 要:为研究一般连通拟阵的二阶圈图的哈密顿性,选取完全二部图K_(2,n)和K_(3,n)进行讨论,证明这两类圈拟阵的二阶圈图的哈密顿性,并证明K_(2,n)的圈拟阵的二阶圈图的连通度和泛圈性,对K_(2,n),K_(3,n)的圈拟阵的二阶圈图的一致哈密顿性提出了一个猜想。The Hamiltonian properties of the second-order circuit graphs of general connected matroids are studied in the paper. The complete bipartite graphs K_(2,n) and K_(3,n) are selected for discussion to prove the Hamiltonian property of the second-order circuit graphs of the two kinds of circuit matroids and the connectivity and pancyclic property of the second-order circuit graphs of the circuit matroids of K_(2,n). Also,a conjecture on the consistent Hamiltonian property of the second-order circuit graphs of the circuit matroids of K_(2,n) and K_(3,n) is proposed in the paper.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49