def test_process_of_compete_graph(self):
G = gp.complete_graph(4)
hh = gp.HavelHakimi(gp.degree_sequence(G))
p = [[3, 3, 3, 3], [
2,
2,
2,
], [
1,
1,
], [0]]
assert (hh.get_process() == p)
def test_depth_of_complete_graph_is_order_minus_1(self):
for i in range(2, 12):
G = gp.complete_graph(i)
hh = gp.HavelHakimi(gp.degree_sequence(G))
assert (hh.depth() == G.order() - 1)
def test_initial_sequence(self):
G = gp.complete_graph(4)
hh = gp.HavelHakimi(gp.degree_sequence(G))
assert (hh.get_initial_sequence() == [3, 3, 3, 3])
def test_elimination_sequence_of_complete_graph(self):
G = gp.complete_graph(4)
hh = gp.HavelHakimi(gp.degree_sequence(G))
e = [3, 2, 1, 0]
assert (hh.get_elimination_sequence() == e)
def test_common_neighbors_of_single_node_in_K3_is_other_two_nodes(self):
G = gp.complete_graph(3)
assert (gp.common_neighbors(G, [0]) == [1, 2])
def test_2_residue_of_complete_graph_is_three_halves(self):
for i in range(3, 13):
G = gp.complete_graph(i)
assert (gp.k_residue(G, 2) == 1.5)
def test_power_domination_number_of_complete_graph_is_1(self):
for i in range(1, 11):
G = gp.complete_graph(i)
assert (gp.power_domination_number(G) == 1)
def test_elimination_sequence_of_complete_graph(self):
G = gp.complete_graph(5)
assert(gp.elimination_sequence(G) == [4, 3, 2, 1, 0])
def test_complete_graph_is_regular(self):
G = gp.complete_graph(4)
assert(gp.is_regular(G) == True)
def test_K5_is_complete_graph(self):
G = gp.complete_graph(5)
assert (gp.is_complete_graph(G) == True)
def test_irregularity_complete_graph(self):
for i in range(2, 10):
G = gp.complete_graph(i)
assert (gp.irregularity(G) == 1.0)
def test_K4_is_claw_free(self):
G = gp.complete_graph(4)
assert(gp.is_claw_free(G) == True)
def test_bull_is_not_bull_free(self):
G = gp.complete_graph(3)
G.add_edge(1, 3)
G.add_edge(2, 4)
assert(gp.is_bull_free(G) == False)
def test_K4_is_not_triangle_free(self):
G = gp.complete_graph(4)
assert(gp.is_triangle_free(G) == False)
def test_independence_number_of_complete_graph_is_1():
for i in range(1, 13):
G = gp.complete_graph(i)
assert (gp.independence_number(G, method='bf') == 1)
assert (gp.independence_number(G, method='ilp') == 1)
def test_K5_is_4_regular(self):
G = gp.complete_graph(5)
assert(gp.is_k_regular(G, 4) == True)
def test_2_independence_number_of_complete_graph_is_2():
for i in range(2, 11):
G = gp.complete_graph(i)
assert (gp.k_independence_number(G, 2) == 2)
def test_K4_is_cubic(self):
G = gp.complete_graph(4)
assert(gp.is_cubic(G) == True)
def test_residue_of_complete_graph_is_1(self):
for i in range(1, 11):
G = gp.complete_graph(i)
assert (gp.residue(G) == 1)
def test_K5_is_not_sub_cubic(self):
G = gp.complete_graph(5)
assert(gp.is_sub_cubic(G) == False)
def test_clique_number_of_complete_graph_is_order(self):
for i in range(1, 11):
G = gp.complete_graph(i)
assert (gp.clique_number(G) == G.order())
def test_common_neighbors_of_pair_of_nodes_in_K3_is_third_node(self):
G = gp.complete_graph(3)
assert (gp.common_neighbors(G, [0, 1]) == [2])
