Pell graphs are defined on certain ternary strings as special subgraphs of Fibonacci cubes odd index. In this work the domination number, total 2-packing connected paired and signed number studied. Using integer linear programming, exact values some estimates for these numbers small obtained. Furthermore, theoretical bounds obtained graphs.

given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...