Gopika Sharma

collaborators

2 papers

math.CO2023

Computation of Grundy dominating sequences in (co-)bipartite graphs

Boštjan Brešar, Arti Pandey, Gopika Sharma

A sequence $S$ of vertices of a graph $G$ is called a dominating sequence of $G$ if $(i)$ each vertex $v$ of $S$ dominates a vertex of $G$ that was not dominated by any of the vert…

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…