Regular Number of Semitotal block graph of a graph

For any (p, q) graph G, the vertices and blocks of a graph are called its members. The semitotal block graph T_b(G) of a graph G as the graph whose set of vertices is the union of the set of vertices and blocks of G and in which two vertices are adjacent if and only if the corresponding vertices of G are adjacent or the corresponding members are incident.. The regular number of a T_b(G) is the minimum number of subsets into which the edge set of T_b(G) should be partitioned so that the subgraph induced by each subset is regular and is denoted by T_b(G). In this paper some results on regular number of T_b(G) were obtained and expressed in terms of elements of G.