<｜begin▁of▁sentence｜>### Instruction:
Given two tree graphs t1 and t2, where t1 has the edges [(1, 2), (1, 3), (3, 4)] and t2 has the edges [(5, 6), (5, 7), (7, 8)], does the function `check_isomorphism` determine if t1 and t2 are isomorphic and return one mapping of the nodes of t1 onto the nodes of t2 if they are isomorphic?
### Response:
import networkx as nx
from networkx.algorithms.isomorphism import is_isomorphic

def check_isomorphism(t1, t2):
    # Check if the two trees are isomorphic
    iso_map = nx.algorithms.isomorphism.tree_isomorphism(t1, t2)
    return iso_map

# Create two tree graphs t1 and t2
# Example tree t1
edges_t1 = [(1, 2), (1, 3), (3, 4)]
t1 = nx.Graph(edges_t1)

# Example tree t2
edges_t2 = [(5, 6), (5, 7), (7, 8)]
t2 = nx.Graph(edges_t2)

# Check isomorphism and print the result
isomorphism = check_isomorphism(t1, t2)
print(f'Isomorphism: {isomorphism}')
<|EOT|>
