排序方式: 共有55条查询结果,搜索用时 156 毫秒
1.
2.
Darryn E. Bryant Saad El-Zanati Charles Vanden Eynden Dean G. Hoffman 《Graphs and Combinatorics》2001,17(1):55-59
Let S
k
denote the complete bipartite graph K
1,
k
and let Q
n
denote the n-cube. We prove that the obvious necessary conditions for the existence of an S
k
-decomposition of Q
n
are sufficient.
Received: July 21, 1999 Final version received: May 16, 2000 相似文献
3.
4.
A cube factorization of the complete graph on n vertices, Kn, is a 3‐factorization of Kn in which the components of each factor are cubes. We show that there exists a cube factorization of Kn if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc. 相似文献
5.
Keith Jonathan M. Kroese Dirk P. Bryant Darryn 《Methodology and Computing in Applied Probability》2004,6(1):29-53
A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis. 相似文献
6.
7.
Adams Peter Bryant Darryn El-Zanati Saad I. Gavlas Heather 《Graphs and Combinatorics》2003,19(3):289-296
In this paper, we show that K10n can be factored into C5-factors and 1-factors for all non-negative integers and satisfying 2+=10n–1.Research partially supported by an NSF-AWM Mentoring Travel Grant 相似文献
8.
Summary For allm 19 and each meaningful value ofi (2 i m/2), the spectrum problem fori-perfectm-cycle systems is examined. 相似文献
9.
For all oddv 3 the complete graph onvK
v
vertices can be decomposed intov – 2 edge disjoint cycles whose lengths are 3, 3, 4, 5,...,v – 1. Also, for all oddv 7,K
v
can be decomposed intov – 3 edge disjoint cycles whose lengths are 3, 4,...,v – 4,v – 2,v – 1,v.
Research supported by Australian Research Council grant A49130102 相似文献
10.
Darryn E. Bryant 《Designs, Codes and Cryptography》1992,2(2):159-168
For m = 6 and for all odd composite integers m, as well as for all even integers m 10 that satisfy certain conditions, 2-perfect m-cycle systems are constructed whose quasigroups have a homomorphism onto quasigroups which do not correspond to a 2-perfect m-cycle systems. Thus it is shown that for these values of m the class of quasigroups arising from all 2-perfect m-cycle systems does not form a variety. 相似文献