Let $c$ be a proper $k$-coloring of a connected graph $G$ and $Pi:=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $ $c_{{}_Pi}(v):=(d(v,V_1),d(v,V_2),ldots,d(v,V_k)), $ $ where $d(v,V_i)=min{d(v,x)~|~xin V_i}, 1leq ileq k$. If distinct vertices have distinct color codes, then $c$ is called a locating coloring. The minimum number of colors needed in a locating coloring of $G$ is the locating chromatic number of $G$, denoted by $Cchi_{{}_L}(G)$. %%%%% In this thesis, we study the locating chromatic number of Kneser graphs, Cartesian product of graphs, and the join of graphs. First, among some other results we show that $Cchi_{{}_L}(KG(n,2))=n-1$ for all $ngeq 5$. Then, we prove that $Cchi_{{}_L}(KG(n,k))leq n-1$, when $ngeq k^2$. Moreover, we present some bounds for the locating chromatic number of odd graphs, which shows the difference between the chromatic number and the locating chromatic number of these graphs can be arbitrary far apart. %%%%% Also, we determine the locating chromatic number of the grids and the Cartesian product of paths and complete graphs. For the Cartesian product of two complete graphs, we compute the exact value of the locating chromatic number in some cases, and we offer conjectures for the remaining cases. %%%%% In order to study the locating chromatic number of the join of graphs, we define a new parameter which is closely related to the locating chromatic number. Then, using this parameter, we determine the exact value of the locating chromatic number of the join of paths, cycles and complete multipartite graphs.