A k-hypertournament is a complete k-hypergraph with all k-edges endowed with orientations. The incidence matrix associated with a k-hypertournament is called a k-hypertournament matrix. Some properties of the hypertournament matrices are investigated. The sequences of the numbers of 1's and -1's of
A note on hypertournaments
β Scribed by Linqiang Pan; Guofei Zhou; Kemin Zhang
- Book ID
- 105728460
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 345 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1001-6538
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this work, we find a necessary and sufficient condition for the normality of an h-hypertoumament matrix. Moreover, we give a sufficient condition for (n -1)/2 to be the spectral radiuz of a normal h-hypertournament matrix of order n. Also, we answer an open question suggested by Kirkland.
## Abstract A hypertournament or a __k__βtournament, on __n__ vertices, 2β€__k__β€__n__, is a pair __T__=(__V, E__), where the vertex set __V__ is a set of size __n__ and the edge set __E__ is the collection of all possible subsets of size __k__ of __V__, called the edges, each taken in one of its __