Total Outer-Independent Domination Number: Bounds and Algorithms

Bosch, Paul; Parra Inza, Ernesto; Rios Villamar, Ismael; Sánchez-Santiesteban, José Luis

Publication:
Total Outer-Independent Domination Number: Bounds and Algorithms

Files

algorithms-18-00159-v2.pdf (4.15 MB)

Date

2025

Type:

Article

Collections

Artículos Ingeniería

Descargas totales

0

Vistas totales

1

Métricas

Gestores bibliográficos

Authors

Bosch, Paul

Parra Inza, Ernesto

Rios Villamar, Ismael

Sánchez-Santiesteban, José Luis

item.page.doiurl

https://doi.org/10.3390/a18030159

URI

https://hdl.handle.net/11447/11226

item.page.extent

18 p.

item.page.accessRights

Acceso abierto

Abstract

In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V, E); a subset of its vertices is a total do...

Citation

Bosch, P., Parra Inza, E., Rios Villamar, I., & Sánchez-Santiesteban, J. L. (2025). Total Outer-Independent Domination Number: Bounds and Algorithms. Algorithms, 18(3), 159. https://doi.org/10.3390/a18030159

Keywords

Graph theory , Total outer-independent dominating set , Integer linear program , Heuristic algorithm , Time complexity

Estadísticas de uso

1 0,8 0,5 0,3 0