Upper bounds for products of four measures of distances in graphs: diameter, radius, average eccentricity and remoteness with three measures of connectivity: vertex connectivity, algebraic connectivity and edge connectivity are analyzed. Twelve conjectures are obtained by the AGX 2 software. Eight of them are proved to be correct, three are disproved and one remains an open problem.