9 citations · 9 across the 5 of their papers we have counts for
6 papers
On four network monitoring parameters in graphs and their gaps
Zin Mar Myint, Avikal Srivastava
Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodet…
On Monitoring Edge-Geodetic Sets of Dynamic Graph
Zin Mar Myint, Ashish Saxena
The concept of a monitoring edge-geodetic set (MEG-set) in a graph , denoted , refers to a subset of vertices such that every edge in is m…
The Closed Geodetic Game: algorithms and strategies
Antoine Dailly, Harmender Gahlawat, Zin Mar Myint
The geodetic closure of a set S of vertices of a graph is the set of all vertices in shortest paths between pairs of vertices of S. A set S of vertices in a graph is geodetic if it…
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
Florent Foucaud, Clara Marcille, Zin Mar Myint +3
A monitoring edge-geodetic set, or simply an MEG-set, of a graph is a vertex subset such that given any edge of , lies on every shortest - p…
A theoretical expansion of the Sprout game
Soura Sena Das, Zin Mar Myint, Soumen Nandi +2
Sprout is a two-player pen and paper game which starts with vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-…
Cops and robber on variants of retracts and subdivisions of oriented graphs
Harmender Gahlawat, Zin Mar Myint, Sagnik Sen
\textsc{Cops and Robber} is one of the most studied two-player pursuit-evasion games played on graphs, where multiple \textit{cops}, controlled by one player, pursue a single \text…