The Sombor index of a graph G is defined as SO(G) = Puv2E(G) pd2G(u) + d2G(v), where dG(u) denotes the degree of the vertex u of G. Accordingly, the multiplicative Sombor index of G can be defined as QSO(G) = Quv2E(G) pd2G(u) + d2G(v). In this article, some graph transformations which increase or decrease the multiplicative Sombor index are first introduced. Then by using these transformations, extremal values of the multiplicative Sombor index of trees and unicyclic graphs are determined.