On scores, losing scores and total scores in hypertournaments
From MaRDI portal
Publication:5006548
DOI10.5614/ejgta.2015.3.1.2zbMath1467.05097OpenAlexW2171410117MaRDI QIDQ5006548
Zhou Guofei, Muhammad A. Khan, Koko K. Kayibi, Shariefuddin Pirzada
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2015.3.1.2
Related Items (3)
On the scores and degrees in hypertournaments ⋮ Miscellaneous Digraph Classes ⋮ Symmetry in domination for hypergraphs with choice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On score sets in tournaments
- Score sequences in oriented graphs
- Score lists in \( (h, k)\)-bipartite hypertournaments
- Degree sequences of \(k\)-multi-hypertournaments
- Score vectors of tournaments
- On \(k\)-hypertournament matrices
- On score sequences of \(k\)-hypertournaments
- Score lists in tripartite hypertournaments
- Note on the degree sequences of \(k\)-hypertournaments
- Mark sequences in digraphs
- Scores, inequalities and regular hypertournaments
- Reconstruction of complete interval tournaments. II
- Score sets in oriented graphs
- Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
- Uniform sampling ofk-hypertournaments
- Kings in Multipartite Tournaments And Hypertournaments
This page was built for publication: On scores, losing scores and total scores in hypertournaments
