本文已被：浏览 1464次 下载 1727次
Received:January 26, 2016 Revised:April 08, 2016
Received:January 26, 2016 Revised:April 08, 2016
中文摘要: 顶点标记半图是用n个不同符号标记的半图G.通过分析得出只包含不相邻边的顶点标记半图的计数和包含两个相邻S边的顶点标记半图的数目的计算的多种结果.同时也计算了包含1到8个顶点的顶点标记半图的数目.
Abstract:A vertex-labeled semigraph is a semigraph whose n-vertices are labeled by distinct symbols. Various results on enumeration of vertex-labeled semigraphs containing non-adjacent edges and the number of vertex-labeled semigraphs with two adjacent s-edges are obtained. Also the number of vertex-labeled semigraphs from 1 to 8 vertices is calculated.
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金（11371174，11301227）；江苏省自然科学基金（BK20130119）
引用文本：
王庆亮,孔祥智,袁志玲.半图的计数.计算机系统应用,2016,25(10):263-267
WANG Qing-Liang,KONG Xiang-Zhi,YUAN Zhi-Ling.On Enumeration of Some Semigraphs.COMPUTER SYSTEMS APPLICATIONS,2016,25(10):263-267
王庆亮,孔祥智,袁志玲.半图的计数.计算机系统应用,2016,25(10):263-267
WANG Qing-Liang,KONG Xiang-Zhi,YUAN Zhi-Ling.On Enumeration of Some Semigraphs.COMPUTER SYSTEMS APPLICATIONS,2016,25(10):263-267
