Construction of all tournament matrices with prescribed row sum vector

Basit Öğe Kaydı
dc.authoridKurkcu, Burak/0009-0000-5467-7074
dc.authoridhacioglu, ilhan/0000-0002-1692-4502
dc.contributor.authorHacioglu, Ilhan
dc.contributor.authorKurkcu, Burak
dc.date.accessioned2025-01-27T20:34:39Z
dc.date.available2025-01-27T20:34:39Z
dc.date.issued2014
dc.departmentÇanakkale Onsekiz Mart Üniversitesi
dc.description.abstractIn this article, we define the binary codes of tournament matrices in the class T(R) and give unique construction algorithms for matrices which have minimum and maximum binary codes. By introducing a generating algorithm with an order we show that all matrices in class T(R) can be sorted uniquely between matrices with minimum and maximum binary codes. (C) 2014 Elsevier B.V. All rights reserved.
dc.identifier.doi10.1016/j.dam.2014.02.019
dc.identifier.endpage152
dc.identifier.issn0166-218X
dc.identifier.issn1872-6771
dc.identifier.scopus2-s2.0-84898539080
dc.identifier.scopusqualityQ1
dc.identifier.startpage147
dc.identifier.urihttps://doi.org/10.1016/j.dam.2014.02.019
dc.identifier.urihttps://hdl.handle.net/20.500.12428/23401
dc.identifier.volume171
dc.identifier.wosWOS:000336008100017
dc.identifier.wosqualityQ3
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofDiscrete Applied Mathematics
dc.relation.publicationcategoryinfo:eu-repo/semantics/openAccess
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20250125
dc.subjectBinary code
dc.subjectTournament matrix
dc.subjectGenerating algorithm
dc.titleConstruction of all tournament matrices with prescribed row sum vector
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu