Two proper edge-colorings of a graph G are mate-colorings if and only if every vertex of G is incident to the same set of colors under each edge-coloring while each edge receives a different color under each edge-coloring. The color-trade-spectrum (CTS) of a graph G is the set of all t for which there exist two mate-colorings of G using t colors. A generalized theta graph, denoted \(\theta_{n_1,n_2,...,n_k}\), consists of k paths having only the starting and ending vertices in common with lengths \(n_1,n_2,...,n_k\in\mathbb{N}\). A generalized wheel graph, denoted \(W^{n}_{k}\), consists of a central vertex and an n-cycle with a path of length n between the central vertex and each vertex in the cycle. We determine the color-trade-spectra of generalized theta graphs and generalized wheel graphs.