Objects, Invariants and Properties for Graph Theory (GT) automated conjecturing: in particular with the Sage program CONJECTURING: http://nvcleemp.github.io/conjecturing/
The star graph s3 could either be a graph with 3 vertices or 3 edges (4 vertices).
a better (less confusable) name for the star graphs would be k_1_n where n is the number of rays. so Sage's s3 would be k_1_3 (the complete bipartite graph with partite sets of cardinality 1 and n).
change all sn definitions in gt.sage from sn to k_1_n (for clarity)
rbarden
commented
7 years ago
The star graph s3 could either be a graph with 3 vertices or 3 edges (4 vertices).
a better (less confusable) name for the star graphs would be k_1_n where n is the number of rays. so Sage's s3 would be k_1_3 (the complete bipartite graph with partite sets of cardinality 1 and n).
change all sn definitions in gt.sage from sn to k_1_n (for clarity)