位置：成果数据库 > 期刊 > 期刊详情页
On the Packing Number of Generalized Petersen Graphs P(n, 2)
  • ISSN号：0381-7032
  • 期刊名称：Ars Combinatoria
  • 时间：0
  • 页码：23-32
  • 相关项目：几类互连网络拓扑结构图的交叉数算法及其应用研究
作者： Yang Yuansheng|Fu Xueliang|Jiang Baoqi|
同期刊论文项目
几类互连网络拓扑结构图的交叉数算法及其应用研究
期刊论文 30
同项目期刊论文
On the 3-gamma(t)-Critical Graphs of Order Delta(G)+3
Irregular total labellings of C-m square C-n
Hamiltonian properties of the 3-(γ,2)-critical graphs
Combining structured and flat features by a composite kernel to detect hedges scope in biological te
Voting-based ensemble classifiers to detect hedges and their scopes in biomedical texts
A lower bound for 2-rainbow domination number of generalized Petersen graphs P(n,3)
On the Domination Number of the Circulant Graphs C(n; {1, 2}), C(n; {1, 3}) and C(n; {1, 4})
On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)
Using ontology to generate test cases for GUI testing
On the Prime labeling of generalized Petersen graph P(n, 1)
On the prime cordial labeling of generalized Petersen graph
(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks
The Connected Domination and Tree Domination of P(n, k) for k=1,2, left perpendicular n/2 right perp
A note on the cyclic connectivity property of directed graphs
星图S4的交叉数
The crossing number of the generalized Petersen graph P(10, 3) is six
An upper bound for the crossing number of bubble-sort graph Bn
Skolem-Gracefulness of k-Stars
Liar';s Domination Number of Generalized Petersen Graphs P(n, 1) and P(n, 2)
Prime Cordial labeling of Flower Snark and related graphs
Some Graphs with Double Domination Subdivision Number Three
对等网络环境下关联任务动态调度策略
基于选择性复制前驱任务的DAG调度算法
基于重复博弈和惩戒机制的P2P协作激励信誉模型
Wide Diameter of Generalized Petersen Graphs