Cite

[1] R. Assous, Enchainabilite et seuil de monomorphie des tournois n-aires, Discrete Math.62 (1986), 119–125. ⇒20110.1016/0012-365X(86)90111-1Search in Google Scholar

[2] E. Barbut, A. Bialostocki, A generalization of rotational tournaments, Discrete Math.76 (1989), 81–87. ⇒20110.1016/0012-365X(89)90301-4Search in Google Scholar

[3] T. A. Chisthi, G. Zhou, S. Pirzada, A. Iványi, On independence numbers of uniform hypergraphs, Acta Univ. Sapientiae, Informatica6, 1 (2014) 132–158. ⇒20410.2478/ausi-2014-0022Search in Google Scholar

[4] P. Frankl, What must be contained in every oriented k-uniform hypergraph, Discrete Math.62 (1986), 311–313. ⇒20110.1016/0012-365X(86)90219-0Search in Google Scholar

[5] G. Gutin, A. Yeo, Hamiltonian paths and cycles in hypertournaments, J. Graph Theory25 (1997), 277–286. ⇒20110.1002/(SICI)1097-0118(199708)25:4<277::AID-JGT5>3.0.CO;2-HSearch in Google Scholar

[6] K. K. Kayibi, M. A. Khan, S. Pirzada, Uniform sampling of k-hypertournaments, Linear and Multilinear Algebra61, 1 (2013), 123–138. ⇒20110.1080/03081087.2012.664771Search in Google Scholar

[7] Y. Koh, S. Ree, On k-hypertournament matrices, Lin. Alg. Appl.373 (2002) 183–195. ⇒202, 20310.1016/S0024-3795(02)00726-7Search in Google Scholar

[8] M. A. Khan, S. Pirzada, K. K. Kayibii, Scores, Inequalities and regular hypertournaments, J. Math. Inequal. Appl. 15, 2 (2012) 343–351. ⇒203, 20410.7153/mia-15-28Search in Google Scholar

[9] 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. ⇒201, 20410.1007/BF02476378Search in Google Scholar

[10] S. Pirzada, On scores in multipartite hypertournaments, Eurasian Math. Journal, 2, 1 (2011) 112–119. ⇒201Search in Google Scholar

[11] S. Pirzada, An Introduction to Graph Theory, Universities Press, Orient Blackswan, 2012. ⇒201Search in Google Scholar

[12] S. Pirzada, Score lists in bipartite multi hypertournaments, Math. Vesnik64, 4 (2012) 286–296. ⇒201Search in Google Scholar

[13] S. Pirzada, hypertournaments-Scores, losing scores, total scores and degrees, J. Comp. Math. Comb. Comp.84 (2013) 95–108. ⇒201Search in Google Scholar

[14] S. Pirzada, T. A. Naikoo, Score sets in tournaments, Vietnam J. Math.34, 2 (2006) 157–161. ⇒201Search in Google Scholar

[15] S. Pirzada, U. Samee, Mark sequences in digraphs, Seminaire Lotharingien de Combinatoire55 (2006) B55c. ⇒201Search in Google Scholar

[16] S. Pirzada, T. A. Naikoo, N. A. Shah, Score sequences in oriented graphs, J. Appl. Math. Comp.23, 1–2 (2007) 257–268. ⇒20110.1007/BF02831973Search in Google Scholar

[17] S. Pirzada, G. Zhou, Score lists in (h,k)-bipartite hypertournaments, Appl. Math. J. Chinese Universities, Series B22, 4 (2007) 485–489. ⇒20110.1007/s11766-007-0415-ySearch in Google Scholar

[18] S. Pirzada,, T. A. Naikoo, G. Zhou, Score lists in tripartite hypertournaments, Graphs and Combinatorics23, 4 (2007) 445–454. ⇒20110.1007/s00373-007-0735-ySearch in Google Scholar

[19] S. Pirzada, T. A. Naikoo, Score sets in oriented graphs, Appl. Analysis and Discrete Math.2, 1 (2008) 107–113. ⇒20110.2298/AADM0801107PSearch in Google Scholar

[20] S. Pirzada, G. Zhou, On k-hypertournament losing scores, Acta Univ. Sapientiae, Informatica2, 1 (2010) 5–9. ⇒201Search in Google Scholar

[21] S. Pirzada, G. Zhou, A. Iványi, Score lists in multipartite hypertournaments, Acta Univ. Sapientiae, Informatica 2, 2 (2010) 184–193. ⇒201Search in Google Scholar

[22] S. Pirzada, G. Zhou, Degree lists in k-bipartite hypertournaments, TWMS J. Pure and Appl. Math.5, 2 (2014), 89–116. ⇒201Search in Google Scholar

[23] S. Pirzada, M. A. Khan, G. Zhou, K. K. Kayibi, On scores, losing scores and total scores in hypertournaments, Electronic J. Graph Theory Appl.3, 1 (2015) 8–21. ⇒20110.5614/ejgta.2015.3.1.2Search in Google Scholar

[24] C. Wang, G. Zhou, Note on the degree sequences of k-hypertournaments, Discrete Math.308, 11 (2008) 2292–2296. ⇒204Search in Google Scholar

[25] G. Zhou, S. Pirzada, Degree sequences in oriented k-hypergraphs, J. Appl. Math., Comp.27, 1-2 (2008) 149–158. ⇒20110.1007/s12190-008-0047-2Search in Google Scholar

[26] G. Zhou, Y. Tianxing, Z. Kemin, On score sequences of k-hypertournament, Europ. J. Comb.21 (2000), 993–1000. ⇒20110.1006/eujc.2000.0393Search in Google Scholar

[27] G. Zhou, K. Zhang, On the degree sequences of k-hypertournaments, Chinese Annals of Math., Series A22, 1 (2001) 115–120. ⇒204Search in Google Scholar

eISSN:
2066-7760
Idioma:
Inglés
Calendario de la edición:
2 veces al año
Temas de la revista:
Computer Sciences, other