- 相關(guān)推薦
Degree sequences of k-multi-hypertournaments
Let n and k (n ≥ k > 1) be two non-negative integers. A k-multi-hypertournament on n vertices is a pair (V, A), where V is a set of vertices with |V|= n, and A is a set of k-tuples of vertices, called arcs, such that for any k-subset S of V, A contains at least one (at most k!) of the k! k-tuples whose entries belong to S. The necessary and sufficient conditions for a non-decreasing sequence of non-negative integers to be the out-degree sequence (in-degree sequence) of some k-multi-hypertournament are given.
【Degree sequences of k-multi-hypertou】相關(guān)文章:
VARIABILITY SETS AND HAMILTON SEQUENCES04-29
ON ALMOST SURE CONVERGENCE OF WEIGHTED SUMS OF RANDOM ELEMENT SEQUENCES04-26
有關(guān)MBA degree的英語(yǔ)求職信范文01-16
Measurement of six degree-of-freedom ground motion by using eight accelerometers04-29
大學(xué)文憑是否必要?Is a college degree necessary in todays world?-英語(yǔ)作文03-11
A new adaptive fast motion estimation algorithm based on local motion similarity degree (LMSD)04-29