In this example of determinising an NFA, isn't there an edge missing in the result?
The standard definition of DFAs involves a transition function, that is total. That means that, from every state, there should be an arrow for each symbol. So, yes, there is a missing $b$&nbsp;arrow from $q_4$ to&nbsp;$\emptyset$ and also, missing $a$ and $b$ arrows from $\emptyset$ to itself. While we're at it, the diagram also has no indicated start state.

Note, though, that some authors use the convention that, if there's no transition given for some symbol from some state then, when the automaton reads that symbol in that state, it goes to a "dead" state. The dead state is non-accepting and the automaton cannot leave it (reading any character keeps it in that state).  The author of your book might be using that convention inconsistently: the dead state is&nbsp;$\emptyset$ but they've only shown some of the transitions that lead to it.  I think that's bad style: in my opinion, it's clearest to either show all the transitions to the dead state, or none of them.