A graph label involves allocating integers to the edges, vertices, or both, subject to certain restrictions. Assigning a value of 0 or 1 to a graph’s vertices (or edges) in particular conditions is known as “cordial labeling”. The absolute disparity between the total number of vertices marked with 0 and the total number of vertices marked with 1 must be either 0 or 1. A graph \(F\) with n vertices is said to have cubic roots cordial labeling if each vertex is marked either 1, \(\delta \) or \({\delta }^{2}.\) The absolute disparity between the total number of vertices marked with 1 and the total number of vertices marked with \(\delta \) must be either 0 or 1. The absolute disparity between the total number of vertices marked with \(\delta \)  and the total number of vertices marked with \({\delta }^{2}\) must be either 0 or 1. The induced edge is from the set either 1, \(\delta \) or \({\delta }^{2}\) . Also, the absolute disparity between the number of edges marked with 1 and the number of edges marked with \(\delta \) must be either 0 or 1. The absolute disparity between the number of edges marked with \(\delta \) and the number of edges marked with \({\delta }^{2}\) must be either 0 or 1. In this paper, we prove the Sunlet graphs and Friendship graphs admit a cubic root cordial labeling.