Overview / Usage

We study a mathematical quantification of graphs, which introduce full order structure of the set of infinite graphs. This quantification expected to introduce a measure to the set of infinite graphs. This concept of this study is already proposed by us in international conferences. But concrete calculation is still in development phase.

Methodology / Approach

High performance Computer environment is essential for our study. We make a map $o$ from the set of isomorphic class of infinite graphs to real number $[0.5,1]$. Concrete calculation of this map needs massive calculation handling large graphs, because it is necessary to count all adjacent matrix expressions of a graph.

Technologies Used

boost::graphs is heavily deployed

Repository

graph order

Other links

• ResearchGate