Comparison of two methods for calculating ranking points using transitive triads

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Bowen Liu

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Discrete Mathematics and its Applications Year:2024 | Volume:9 | Issue:4 Page(s): 309-320

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Comparison of two methods for calculating ranking points using transitive triads

Author(s)

Bowen Liu | Issue Writer Certificate

Keywords

graph

directed graph

tournament

invariant

transitive triads

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans