7 citations · 9 across the 4 of their papers we have counts for
5 papers
Confining the Robber on Cographs
Masood Masjoody
In this paper, the notions of {\em trapping} and {\em confining} the robber on a graph are introduced. We present some structural necessary conditions for graphs not containing…
On the structure of (claw,bull)-free graphs
Sebastián González Hermosillo de la Maza, Yifan Jing, Masood Masjoody
In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a c…
Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs
Masood Masjoody, Ladislav Stacho
It is known that the class of all graphs not containing a graph as an induced subgraph is cop-bounded if and only if is a forest whose every component is a path. In this st…
Traversal with Enumeration of Geometric Graphs in Bounded Space
Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho
In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a give…
Constructing Geometric Graphs of Cop Number Three
Seyyed Aliasghar Hosseini, Masood Masjoody, Ladislav Stacho
The game of cops and robbers is a pursuit game on graphs where a set of agents, called the cops try to get to the same position of another agent, called the robber. Cops and robber…