2010Journal of Nantong UniversityRequires access

Analysis and Application on Tournament Matrix

Zhang Yan

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Tournament, Tournament selection, Graph theory, Rank (graph theory), Mathematics, Matrix (chemical analysis), Ranking (information retrieval), Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Analysis and Application on Tournament Matrix — Research Paper | ScholarLens