Vikash Tripathi

activity

20192026

collaborators

Showing cs.DMShow all

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

cs.DM2020

Semipaired Domination in Some Subclasses of Chordal Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$ -element subsets such that the vertices in each…

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…