def test_residue_of_cycle_is_third_of_order(self):
for i in range(3, 13):
G = gp.cycle_graph(i)
assert gp.residue(G) == ceil(G.order() / 3)
def test_C5_is_not_complete_graph(self):
G = gp.cycle_graph(5)
assert gp.is_complete_graph(G) == False
def test_non_adjacent_vertices_not_connected_2_dom_set_of_4_cycle():
G = gp.cycle_graph(4)
assert gp.is_connected_k_dominating_set(G, [0, 2], 2) is False
def test_C4_is_triangle_free(self):
G = gp.cycle_graph(4)
assert gp.is_triangle_free(G) == True
def test_3_adjacent_vertice_is_connected_2_dominating_set_of_4_cycle():
G = gp.cycle_graph(4)
assert gp.is_connected_k_dominating_set(G, [0, 1, 2], 2) is True