<｜begin▁of▁sentence｜>### Instruction:
Given two complete graphs, one with 3 vertices and another with 4 vertices, can you create the disjoint union of these two graphs and print the adjacency matrix of the resulting graph?
### Response:
from igraph import Graph

# Creating two separate graphs
g1 = Graph.Full(3)
g2 = Graph.Full(4)

# Creating the disjoint union of the two graphs
disjoint_union_graph = g1.disjoint_union(g2)

# Printing the adjacency matrix of the disjoint union graph
print(disjoint_union_graph.get_adjacency())
<|EOT|>
