DISJOINT

作品数：92被引量：65H指数：4
导出分析报告
相关领域：理学更多>>
相关作者：马建峰郭显冯涛李兴华张为公更多>>
相关机构：东南大学东北大学浙江理工大学天津大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家高技术研究发展计划中国博士后科学基金中央高校基本科研业务费专项资金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Acta Mathematicae Applicatae Sinicax
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Analogy of Fan-type Condition on Weak Cycle Partition of Graphs
《Acta Mathematicae Applicatae Sinica》2025年第2期525-535,共11页Xiao-dong CHEN Qing JI Zhi-quan HU 
supported by the National Natural Science Foundation of China(No.11901268);The Fun-damental Research Funds for the Universities of Liaoning Province(No.LJ212410165065).
For a graph G of order n and a positive integer k,a k-weak cycle partition of G,called k-WCP,is a sequence of vertex disjoint subgraphs H_(1),H_(2),…,H_(k) of G with■_(i=1)^(k),where H_(i) is isomorphic to K_(1),K_(...
关键词：Weak cycle partition Fan-type conditions vertex-disjoint packing 
On Disjoint Cycles of the Same Length in Tournaments
《Acta Mathematicae Applicatae Sinica》2022年第2期271-281,共11页YUN WANG JIN YAN SHUO ZHU 
supported by the National Natural Science Foundation of China(Nos.12071260,11671232)。
A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical techniqu...
关键词：TOURNAMENTS minimum out-degree disjoint cycles 
Hypergraph Turan Numbers of Vertex Disjoint Cycles
《Acta Mathematicae Applicatae Sinica》2022年第1期229-234,共6页Ran GU Xue-liang LI Yong-tang SHI 
partially supported by the National Natural Science Foundation of China(Nos.12131013,11871034);partially supported by the National Natural Science Foundation of China(Nos.11922112,12161141006);the Natural Science Foundation of Tianjin(Nos.20JCZDJC00840,20JCJQJC00090)。
The Turan number of a k-uniform hypergraph H,denoted by exk(n;H),is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph.Let Cl(k)denote the family of all k-un...
关键词：Turan number cycles extremal hypergraphs 
Disjoint Cliques in Claw-free Graphs
《Acta Mathematicae Applicatae Sinica》2018年第1期19-34,共16页Su-yun JIANG Jin YAN 
Supported by the National Natural Science Foundation of China(Grant No.11271230,11671232)
A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K_（1,3）. Let s and k be two integers with 0≤s≤k and let G be a claw-free graph of order n. In this paper, we investigate cli...
关键词：claw-free graphs disjoint clique degree condition 
The Existence of (v,4,1) Disjoint Difference Families with a Prime Power
《Acta Mathematicae Applicatae Sinica》2008年第4期643-648,共6页Dian-hua Wu Jian-xiao Yang Bi-chang Huang 
Supported by the National Natural Science Foundation of China(No.10561002);Guangxi Science Foundation(No.0640062);Innovation Project of Guangxi Graduate Education.
A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be repres...
关键词：Difference family disjoint difference family optimal optical orthogonal codes character sum 
Generalized Steiner Triple Systems with Group Size g ≡0, 3 (mod 6)
《Acta Mathematicae Applicatae Sinica》2002年第4期561-568,共8页Gen-nian GeDepartment of Mathematics, Suzhou University, Suzhou 215006, China 
in part by YNSFC (No.10001026).
Generalized Steirier triple systems, GS(2,3,n,g), are equivalent to maximum constant weight codes over an alphabet of size g+1 with distance 3 and weight 3 in which each codeword has length n. The necessary condition...
关键词：Generalized Steiner triple system constant weight codes singular indirect product DISJOINT 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部