Jurnal
SINTA 1
On scores, losing scores and total scores in hypertournaments
Electronic Journal of Graph Theory and Applications · Vol. 3 No. 1 (2015) · hlm. 8–21
ISSN 2338-2287
Terbit 2015-03-22
Penerbit GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa eng
Abstrak
A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a $k$-hypertournament, the score $s_{i}$ (losing score $r_{i}$) of a vertex $v_{i}$ is the number of arcs containing $v_{i}$ in which $v_{i}$ is not the last element (in which $v_{i}$ is the last element). The total score of $v_{i}$ is defined as $t_{i}=s_{i}-r_{i}$. In this paper we obtain stronger inequalities for the quantities $\sum_{i\in I}r_{i}$, $\sum_{i\in I}s_{i}$ and $\sum_{i\in I}t_{i}$, where $I\subseteq \{ 1,2,\ldots,n\}$. Furthermore, we discuss the case of equality for these inequalities. We also characterize total score sequences of strong $k$-hypertournaments.
Jaringan kolaborasi para penulis
9 penulis ·
15 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Qatar University Bandung Institute of Technology Afiliasi tidak diketahui
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">On scores, losing scores and total scores in hypertournaments</dc:title>
<dc:creator>Pirzada, Shariefuddin; University of Kashmir</dc:creator>
<dc:creator>Khan, Muhammad Ali; University of Calgary</dc:creator>
<dc:creator>Guofei, Zhou; Nanjing University</dc:creator>
<dc:creator>Kayibi, Koko K; Qatar University</dc:creator>
<dc:subject xml:lang="en-US">Tournament, hypertournament, score, losing score, total score</dc:subject>
<dc:description xml:lang="en-US">A $k$-hypertournament is a complete $k$-hypergraph with each $k$-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a $k$-hypertournament, the score $s_{i}$ (losing score $r_{i}$) of a vertex $v_{i}$ is the number of arcs containing $v_{i}$ in which $v_{i}$ is not the last element (in which $v_{i}$ is the last element). The total score of $v_{i}$ is defined as $t_{i}=s_{i}-r_{i}$. In this paper we obtain stronger inequalities for the quantities $\sum_{i\in I}r_{i}$, $\sum_{i\in I}s_{i}$ and $\sum_{i\in I}t_{i}$, where $I\subseteq \{ 1,2,\ldots,n\}$. Furthermore, we discuss the case of equality for these inequalities. We also characterize total score sequences of strong $k$-hypertournaments.</dc:description>
<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
<dc:contributor xml:lang="en-US"></dc:contributor>
<dc:date>2015-03-22</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/100</dc:identifier>
<dc:identifier>10.5614/ejgta.2015.3.1.2</dc:identifier>
<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications; 8-21</dc:source>
<dc:source>2338-2287</dc:source>
<dc:language>eng</dc:language>
<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/100/30</dc:relation>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Pirzada, S. U. o. K., Khan, M. A. U. o. C., Guofei, Z. N. U., & Kayibi, K. K. Q. U. (2015). On scores, losing scores and total scores in hypertournaments. Electronic Journal of Graph Theory and Applications, 3(1), 8–21. https://doi.org/10.5614/ejgta.2015.3.1.2
Salin
IEEE
S. U. o. K. Pirzada, M. A. U. o. C. Khan, Z. N. U. Guofei, and K. K. Q. U. Kayibi, “On scores, losing scores and total scores in hypertournaments,” Electronic Journal of Graph Theory and Applications, vol. 3, no. 1, pp. 8–21, 2015, doi: 10.5614/ejgta.2015.3.1.2.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.