Comparison of two methods for calculating ranking points using transitive triads

Document Type : Full Length Article

Author

Department of Mathematics, Shenzhen MSU-BIT University, Shenzhen, China.

Abstract

To date, the feasibility of constructing a complete graph invariant in polynomial time remains uncertain. Therefore, developing fast algorithms for checking non-isomorphism, including heuristic ones, is crucial. Successful implementation of these heuristics involves modifying existing graph invariants and creating new ones, both of which are still pertinent. Many existing invariants enable the distinction of a large number of graphs in real time.
This paper introduces an invariant specifically for tournaments, a type of directed graph. Tournaments are interesting because the number of different tournaments, given a fixed order of vertices, matches the number of undirected graphs with the same fixed order. The proposed invariant considers all possible tournaments formed by subsets of vertices from the given digraph with the same set of arcs. For each subset tournament, standard places are calculated and summed to determine the final vertex points, which constitute the new invariant.
Our calculations reveal that the new invariant differs from the most natural tournament invariant, which assigns points to each participant. Initial computational experiments show that the smallest pair correlation between sequences representing these two invariants is observed at dimension 15.

Graphical Abstract

Comparison of two methods for calculating ranking points using transitive triads

Keywords

Main Subjects

Journal of Discrete Mathematics and Its Applications
Volume 9, Issue 4
December 2024
Pages 309-320

Files

History

  • Receive Date: 17 October 2024
  • Revise Date: 19 November 2024
  • Accept Date: 25 November 2024
  • Publish Date: 01 December 2024

Share

How to cite

Statistics