检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高秀莲[1]
出 处:《德州学院学报》2009年第6期16-19,共4页Journal of Dezhou University
摘 要:图G的排斥(整)和数ε(G)(ζ′(G))是使得G∪nK1是排斥(整)和图的非负整数n的最小值.证明了任何图的排斥和数与排斥整和数都相等;图Cn×K2称为棱柱.将棱柱上下底面的边Cn(称为缘边)进行一次剖分,形成的图称为残柱体,并证明了残柱体的排斥和数等于4.The exclusive (integral) sum numbers(G)(ξ'(G))of G is the smallest number of isolated vertices which when added to G result in an exclusive integral sum graph. This paper has proved the exclusive integral sum number is equal to the exclusive sum number for all graph G; The graph Cn×K2 is called prism .It is called incomplete prism when we give a subdivision to Cn of prism ; and this paper has proved the exlusive sum number of incomplete prism is 4 for all n≥3.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3