<｜begin▁of▁sentence｜>### Instruction:
Given the mechanism where a growing network (GN) graph is constructed by adding nodes one at a time, and each new node is connected to an existing node, with preference given to nodes of higher degree according to a specific kernel function, can you create a GN graph with 10 nodes where the attachment kernel is a function of the degree raised to the power of 1.5 and subsequently provide a representation of this graph in an undirected form?
### Response:
import networkx as nx

# Function to represent the attachment kernel
kernel = lambda x: x ** 1.5

# Generate a GN graph with 10 nodes
D = nx.gn_graph(10, kernel=kernel)

# Convert the directed GN graph to undirected
G = D.to_undirected()

print('Nodes:', G.nodes())
print('Edges:', G.edges())
<|EOT|>
