Constructing the spectrum for packings of the complete graph with trees that have up to five edges

被引：0

|

作者：

Dyer, Danny ^{[1
]}

Haghshenas, Sadegheh ^{[1
]}

Shalaby, Nabil ^{[1
]}

机构：

[1] Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's,NL,A1C 5S7, Canada

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2016年 / 98卷

关键词：

DNA sequences;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：65 / 88

相关论文

共 6 条

[1] Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges
Danny Dyer
Sadegheh Haghshenas
Nabil Shalaby
Graphs and Combinatorics, 2016, 32 : 943 - 961
[2] Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges
Dyer, Danny
Haghshenas, Sadegheh
Shalaby, Nabil
GRAPHS AND COMBINATORICS, 2016, 32 (03) : 943 - 961
[3] Constructing the spectrum of packings and coverings for the complete graph with 4-stars
1600, Charles Babbage Research Centre (96):
[4] A note to maximum packings of Kv with a graph G of five vertices and five edges
Milici, S
UTILITAS MATHEMATICA, 2005, 68 : 145 - 153
[5] The spectrum of optimal excess graphs for trees with up to four edges
Dyer, Danny
Haghshenas, Sadegheh
Shalaby, Nabil
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2019, 16 (03) : 272 - 279
[6] A COMPLETE SOLUTION TO THE SPECTRUM PROBLEM FOR GRAPHS WITH SIX VERTICES AND UP TO NINE EDGES
Kolotoglu, Emre
CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2020, 15 (03) : 1 - 24