Graph labeling is an active field of study in graph theory. A graph’s labeling is the assigning of values to its vertices and edges under specified conditions. Harary (Graph Theory. Adision – Wesley, Reading Mass; 1969) introduced the concept of sum labeling in 1990. Hedge and Shankaran (On Triangular Sum Labeling of Graphs in Labeling of Discrete Structures and Applications, pp 109–115. Narosa Publishing House, New Delhi; 2008) introduced a labeling of graph with q edges to admit triangular sum labeling if it is a one-to-one function that vertex of G is mapping to the natural numbers that induce a bijection \(f^*:E(G)\to \{T_1,T_2,\ldots ,T_q \}\) of the edges of the graph G defined by \(f^*(uv)=f(u)+f(v)\) , \(\forall \) e = uv \(\in E(G)\) , which are the first q triangular numbers. From the triangular number, they derived the centered triangular number. In this paper, we proved that snowflake graph and bi-snowflake graph admit the triangular and centered triangular sum labeling.