Arti Pandey

collaborators

2 papers

cs.DS2021

Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

Gopika Sharma, Arti Pandey, Michael C. Wigal

For a given graph $G$ , a maximum internal spanning tree of $G$ is a spanning tree of $G$ with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem…

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…