Summary: The independent-domination number of a graph is the cardinality of a smallest set of mutually non-adjacent vertices which has the property that every vertex not in the set is adjacent to at least one that is. We present several conjectures made by the computer program Graffiti.pc about the independent-domination number of graphs, providing proofs and partial results for some of these conjectures.