k-tuple and k-tuple total dominations on web graphs

LINEAR ALGORITHM, CIRCULAR-ARC GRAPH SUBCLASS, AUGMENTED ADJACENCY MATRICES, MODULAR ARITHMETIC, BOUNDSDOBSON, M.P; LOPEZ PUJATO MARIA INES; LEONI, V.

MATEMáTICA CONTEMPORâNEA

Rio de Janeiro RJ: Sociedade Brasileira de Matematica

Año: 2021 vol. 48 p. 31 - 41

0103-9059

In this work we address $k$-tuple and $k$-tuple total dominations on the subclass of circular-arc graphs given by web graphs. For the non total version, we present a linear time algorithm based on the regularity of the closed neighborhoods associated with web graphs which allows the use of modular arithmetic for integer numbers. For the total version, we derive bounds for this graph class.