Vikash Tripathi

collaborators

2 papers

math.CO2021

A linear-time algorithm for semitotal domination in strongly chordal graphs

Vikash Tripathi, Arti Pandey, Anil Maheshwari

In a graph $G = (V, E)$ with no isolated vertex, a dominating set $D \subseteq V$ , is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$ …

cs.DM2019

Complexity and Algorithms for Semipaired Domination in Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

For a graph $G = (V, E)$ with no isolated vertices, a set $D \subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$ , and $(ii)$ $D$ can be part…