Vikash Tripathi

activity

20192026

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DM2021

Complexity of Paired Domination in AT-free and Planar Graphs

Vikash Tripathi, Ton Kloks, Arti Pandey +2

For a graph $G = (V, E)$ , a subset $D$ of vertex set $V$ , is a dominating set of $G$ if every vertex not in $D$ is adjacent to atleast one vertex of $D$ . A dominating set $D$ of a gra…

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$ …