For a poset  the strict-double-bound graph (sDB-graph sDB(P)) is the graph on Xfor which vertices uand vof sDB(P) are adjacent if and only if  and there exist xand yin Xdistinct from uand vsuch that  and  The strict-double-bound number  of a graph Gis defined as  is a strict-double-bound graph}.

We consider complete pseudo-regular tree  We obtain that  and  where  And we obtain that  for  We also show that  for  or  for  where

strict-double-bound graph, strict-double-bound number, tree.