You are here

Home » Content

Score sequences in oriented k-hypergraphs

Journal Name:

  • European Journal of Pure and Applied Mathematics

Publication Year:

  • 2008

Key Words:

Author NameUniversity of Author

AMS Codes:

Abstract (2. Language): 
Given two non-negative integers n and k with n  k > 1, an oriented k-hypergraph 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 most one of the k! k-tuples whose entries belong to S. In this paper, we define the score of a vertex in an oriented k-hypergraph and then obtain a necessary and sufficient condition for the sequence of non-negative integers [s1, s2, · · · , sn] to be a score sequence of some oriented k-hypergraph.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-score-sequences-oriented-k-hypergraphs.pdf
  • 3
10-20
  • English

REFERENCES

References: 

[1] P. Avery, Score sequences of oriented graphs, J. Graph Theory, Vol. 15, No. 3(1991) 251-257.
[2] C. M. Bang and H. Sharp Jr., Score vectors of tournaments, J. Combin.Theory Ser. B 26 (1)
(1979) 81-84.
[3] Y. Koh and S. Ree, Score sequences of hypertournament matrices, J. Korea Soc. Math. Educ. Ser.
B: Pure and Appl. Math. 8 (2) (2001) 185-191.
[4] Y. Koh and S. Ree, On k-hypertournament matrices, Linear Algebra and its Applications 373
(2003) 183-195.
[5] H. G. Landau, On dominance relations and the structure of animal societies. III. The condition
for a score structure, Bull. Math. Biophys. 15 ( 1953 ) 143-148.
[6] S. Pirzada, T. A. Naikoo and N. A. Shah, Score sequences in oriented graphs, J. Applied Mathematics
and Computing (2006), 22(1-2) (2007) 257-268.
[7] C. Wang and G. Zhou, Note on the degree sequences of k-hypertournaments, Discrete Mathematics,
To appear.
[8] G. Zhou, T. Yao and K. Zhang, On score sequences of k-hypertournaments, European J. Combin.
21 (8) (2000) 993-1000.

Thank you for copying data from http://www.arastirmax.com