Linear_TxGraffiti

Automated conjecturing in graph theory using Python

What is it?

Linear TxGraffiti is the latest version of TxGraffiti, an automated conjecturing program which produces conjectures on simple and connected graphs.

Basic usage

Running the following from the command line will prompt the user to select a graph theory invariant to conjecture on:

python3 write_on_the_wall.py

You will then see the following options displayed in the terminal. Enter in the integer corresponding to the graph invariant you would like to TxGraffiti to conjecture on.

The invariants you may conjecture against are:

domination_number
total_domination_number
connected_domination_number
independence_number
zero_forcing_number
diameter
radius
order
independent_domination_number
chromatic_number
matching_number
min_maximal_matching_number
triameter
min_degree
max_degree
clique_number
residue
annihilation_number
vertex_cover_number
girth
algebraic_connectivity
k-slater-index
k_residual_index
randic_index
augmented_randic_index
harmonic_index
atom_bond_connectivity_index
sum_connectivity_index
first_zagreb_index
second_zagreb_index
slater
sub_total_domination_number
CW_disparity
closed_CW_disparity
inverse_disparity
closed_inverse_disparity
average_vertex_disparity
average_closed_vertex_disparity
irregularity
2-residue
average_degree
paired_domination_number
power_domination_number
2-power_domination_number
2-domination_number
2-forcing_number
total_forcing_number

Why does it exist?

Motivate the study of previously unrelated graph theory invariants.
To assist mathematicians in producing novel research.

License

Released under the 3-Clause BSD license (see LICENSE.txt):