We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the codes. We find a regular subgroup of the automorphism group that can be used for permutation decoding, or...
The Weyl group associated to a Lie algebra of type Bn and the group of graph automorphisms of the n-cube Aut(Qn) are known to be isomorphic to Z2 Sn. We provide a direct isomorphism between them via correspondence of generators. Geck and Pfeiffer have provided a parametrization of ...
图同构/Qn图2) graph isomorphism 图同构 1. Base on this approach, the similarity of process plan instances of different parts can be evaluated by the subgraph isomorphism method, after that, a filter function is performed to scale down the instance set, then the user can select instance ...
2.2 below, our results apply to the n-cube Qn, and for Qn we prove complementary lower bounds to the upper bounds of Theorem 1.4 in =-=[13]-=-... C Borgs,JT Chayes,RVD Hofstad,... - 《Combinatorica》 被引量: 149发表: 2006年 How robust is the n-cube? In this paper several ...
Only one comparison can be done at a time, and the comparisons are made along the n2n−1 edges of the n-cube graph Qn with vertex classes U and V. The paper deals with sequential orderings of these n2n−1 pairs(u, v) ϵU ×V for which the maximum time duration a person has...
R3RkcahbbhR3q7P1luTDUDNM5Pi6P8z3MckfjB/yy6SWr1QnddhyvMG6IGNtVxJ4eyw0c7jbArXWOemGLOt454A0mCfcbwMhjQBycg9SM1r1Umzad7kOCzj/rD6hMbC4jXpg6uU8g7eB3LzN1XF93DHjxYCBKMIeG45pqmsOc3mUj1CbCtnYXgno+mfhNzhRHSth02z4XlGm99v46j/PqGjNRq4WKCwDc45SG3QjJDqDxnRJPKtRdNva...
抖音号:dy1lohzuqn7l8IP属地:四川39岁 最新作品发布时间:2024-12-10 20:58 卖集成灶的小哥哥 私信关注 关注私信 作品20 喜欢 搜索Ta 的作品 视频 日期筛选 12 红姐天天18岁 红姐天天18岁 8 家门口的风景!!! 家门口的风景!!! 33 今天你快乐了吗? 今天你快乐了吗? 11 巴适得很!!! 巴适得很!!!
Recently Zelinka [6] proved that d(Qn), the domatic number of the n-cube, is for n equal 2p − 1 or n equal 2p, exactly 2p. We show here how d(Qn) can be determined for the preceding values, in a very simple way. We then disprove a conjecture by Zelinka and replace it by...
We give new upper and lower bounds for the number of Hamiltonian cycles h(n) in the graph of the n-cube Qn.doi:10.1016/S0195-6698(88)80026-XMollardM.Elsevier BVEuropean Journal of CombinatoricsUn nouvel encadrement du nombre de cycles hamiltoniens du n-cube - Mollard - 1988...
The n-dimensional cube Qn is the graph whose vertices are the subsets of {1, n} where two such vertices are adjacent if and only if their symmetric differe... SB Akers - 《Proc.intl Conf.parallel Processing》 被引量: 952发表: 1987年 Processor Allocation in an N-Cube Multiprocessor Using...