I am not sure whether I am understanding this correctly, so I wanted to check: if we have $O(\Delta \log n)$ where $\Delta$ is the maximum degree of a graph and $n$ is the number of vertices in this graph, then if $\Delta$ is bounded, we can say that
$O(\Delta \log n)\subseteq O(\log n)$?