首页 > 《应用数学学报：英文版》 > 2012年4期 > Decomposition of λKv into Five Graphs with Six Vertices and Eight Edges

Decomposition of λKv into Five Graphs with Six Vertices and Eight Edges

在线阅读下载PDF 导出详情

摘要 Inthispaper,wediscusstheG-decompositionofλKv(G-GDλ(v))intofivegraphswithsixverticesandeightedges.WepresentsomerecursivestructuresandanumberofG-designsofsmallorders,holeyGdesigns,andincompleteG-designsareconstructed.Finally,thespectrumoftheexistenceofG-GDλ(v)isdetermined.

DOI ojnqvrnljr/1172713

作者 Lan-dang YUAN;Qing-de KANG

机构地区不详

出处《应用数学学报：英文版》 2012年4期

关键词分解顶点 G-设计递归结构和数

分类 [理学][基础数学]

出版日期 2012年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）

相关文献

1YanLiu. Distance Between Two Vertices of Maximum Matching Graphs.基础数学,2004-04.
2Hochin Teruhisa. Decomposition of Graphs Representing the Contents of Multimedia Data.计算机应用技术,2010-04.
3WANG Xuan;DONG Lijun. 3D Reconstruction from 2D Line Drawings only with Visible Vertices and Edges.计算机应用技术,2014-01.
4ZHAOYANG ZHANG;JI Guo;BINGLING Gu;LING HAO;GAOGUO YANG;KUN WANG;YANPENG ZHANG. Parametric amplification of Rydberg six- and eight-wave mixing processes.物理,2018-07.
5ZhaoHaixing;LiuRuying;ZhangShenggui. CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHSWITH 5n VERTICES.基础数学,2004-01.
6JIANG Yu;ZHANG Yan-Bin;SUN Wei-Min;ZONG Hong-Shi. Chemical Potential Dependence of Vertices.物理,2008-11.
7Yan LIU;Gui Ying YAN. Graphs Isomorphic to Their Maximum Matching Graphs.基础数学,2009-09.
8孙靓颖. “8”和“eight”.教育学,2015-05.
9. Part Eight动词.教育学,2005-11.
10Phoehe. Eight Little Mice.教育学,2014-11.

来源期刊

应用数学学报：英文版

相关推荐

同分类资源更多

相关关键词

分解顶点 G-设计递归结构和数

返回顶部