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:

0. domination_number

1. total_domination_number

2. connected_domination_number

3. independence_number

4. zero_forcing_number

5. diameter

6. radius

7. order

8. independent_domination_number

9. chromatic_number

10. matching_number

11. min_maximal_matching_number

12. triameter

13. min_degree

14. max_degree

15. clique_number

16. residue

17. annihilation_number

18. vertex_cover_number

19. girth

20. algebraic_connectivity

21. k-slater-index

22. k_residual_index

23. randic_index

24. augmented_randic_index

25. harmonic_index

26. atom_bond_connectivity_index

27. sum_connectivity_index

28. first_zagreb_index

29. second_zagreb_index

30. slater

31. sub_total_domination_number

32. CW_disparity

33. closed_CW_disparity

34. inverse_disparity

35. closed_inverse_disparity

36. average_vertex_disparity

37. average_closed_vertex_disparity

38. irregularity

39. 2-residue

40. average_degree

41. paired_domination_number

42. power_domination_number

43. 2-power_domination_number

44. 2-domination_number

45. 2-forcing_number

46. 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):

Copyright (C) 2021 Linear TxGraffiti Developers
Randy Davila <davilar@uhd.edu>