Please help

In one of the next labs, we'll be talking a lot about how we can identify important nodes in the network. One of the simplest ways, as we will see, is by using degree. However, there are some exceptions where this logic doesn't always work. Describe or draw an example of a network in which a particular node has very few connections, but it could be argued that it is a very important node. Justify your reasoning