Analysis and Application on Tournament Matrix
Zhang Yan
Abstract
Zhang Yan
Abstract
We explore a new model of strongly-connected tournament graph and tournament matrix based on the traditional theory of tournament matrix. A model of basketball match tournament graph is created to count scores and rank double-round matches. The results prove the rationality of the model. When the corresponding tournament graph is strongly connected, ranking with corresponding tournament matrix theory can overcome the limitations of traditional tournament matrix theory which can only be used in ranking single-round matches.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We explore a new model of strongly-connected tournament graph and tournament matrix based on the traditional theory of tournament matrix. A model of basketball match tournament graph is created to count scores and rank double-round matches. The results prove the rationality of the model. When the corresponding tournament graph is strongly connected, ranking with corresponding tournament matrix theory can overcome the limitations of traditional tournament matrix theory which can only be used in ranking single-round matches.
Key concepts: Tournament, Tournament selection, Graph theory, Rank (graph theory), Mathematics, Matrix (chemical analysis), Ranking (information retrieval), Graph