# Total Outer-Independent Domination Number: Bounds and Algorithms
## 3 Heuristic Algorithm
Looking ahead, we believe this research can be extended to tackle more complex variants of domination problems, such as k-tuple domination, secure domination, alliance domination, and total outer k-independent domination, opening new lines of research. In addition to the results presented in this paper, several open problems remain related to \(\gamma_{t}^{oi}(G)\). One significant direction for future research is the study of this parameter in the context of various graph operators and transformations. Specifically, the behavior of \(\gamma_{t}^{oi}(G)\) under graph product operators (e.g., corona product, lexicographic product) and graph transformations (e.g., edge contractions, vertex deletions) remains largely unexplored. Investigating these operators could provide valuable insights and inspire further research in domination theory. Moreover, a comparative analysis with existing domination parameters across various graph families would offer deeper insights into the advantages and limitations of \(\gamma_{t}^{oi}(G)\). Such comparisons could highlight the applicability of \(\gamma_{t}^{oi}(G)\) in relation to well-established parameters, including the powerful k-alliance number, 2-packing number, global offensive k-alliance number, independence number, and independent domination number. Exploring these areas will not only expand our understanding of \(\gamma_{t}^{oi}(G)\) but could also reveal new relationships between domination parameters in different graph families. We believe that addressing these open problems will significantly contribute to the theory of domination in graphs and inspire future research in this area. **Author Contributions:** Conceptualization, P.B., E.P.I. and J.L.S.-S.; methodology, E.P.I., I.R.V. and J.L.S.-S.; software, E.P.I. ; validation, E.P.I. and I.R.V. ; formal analysis, P.B., E.P.I. and J.L.S.-S.; investigation, E.P.I., I.R.V. and J.L.S.-S.; data curation, E.P.I. ; writing--original draft preparation, E.P.I., I.R.V. and J.L.S.-S.; writing--review and editing, P.B., E.P.I. and J.L.S.-S.; visualization, E.P.I. and J.L.S.-S.; supervision, P.B. and J.L.S.-S. All authors have read and agreed to the published version of the manuscript. **Funding:** This research received no external funding. **Data Availability Statement:** Data are available at DOI: [[https://doi.org/10.17632/rr5](https://doi.org/10.17632/rr5) bkj6 dw5.9]([https://doi.org/10.17632/rr5](https://doi.org/10.17632/rr5) bkj6 dw5.9). **Conflicts of Interest:** The authors declare no conflicts of interest. ## Abbreviations

The following abbreviations are used in this manuscript: \begin{tabular}{l l} TDS & Total Dominating Set \\ TOIDS & Total Outer-Independent Dominating Set \\ ILP & Integer Linear Programming \\ RAM & Random Access Memory \\ \end{tabular} 

## References

* (1) [PERSON] Domination in graph with application. _Indian J. Res_**2013**, \(2\), 115-117. * (2) [PERSON] _Applications of Linear Programming Duality to Problems Involving Independence and Domination;_ Simon Fraser University, Computing Science: Burnaby, BC, Canada, 1981. * (3) [PERSON] A survey of selected recent results on total domination in graphs. _Discret. Math._**2009**, _309_, 32-63. [CrossRef]
* (4) [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON], [PERSON]; [PERSON] On computational and combinatorial properties of the total co-independent domination number of graphs. _Comput. J._**2019**, _62_, 97-108. [CrossRef]
* (5) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Computational complexity of outer-independent total and total Roman domination numbers in trees. _IEEE Access_**2018**, \(6\), 35544-35550. [CrossRef]
* (6) [PERSON] [PERSON]; [PERSON] Global offensive alliances in graphs. _Electron. Notes Discret. Math._**2006**, _25_, 157-164. [CrossRef]
* (7) [PERSON]; [PERSON] Bounds on Gromov hyperbolicity constant in graphs. _Proc.-Math. Sci._**2012**, _122_, 53-65. [CrossRef]
* (8) [PERSON]; [PERSON]; [PERSON]; [PERSON] A note on total co-independent domination in trees. _Contrib. Discret. Math._**2024**, _19_, 184-195.