A. Poureidi

collaborators

2 papers

cs.CC2024

On $[1, 2]$ -Domination in Interval and Circle Graphs

Mohsen Alambardar Meybodi, Abolfazl Poureidi

A subset $S$ of vertices in a graph $G = (V, E)$ is a Dominating Set if each vertex in $V (G) ∖ S$ is adjacent to at least one vertex in $S$ . Chellali et al. in 2013, by restri…

cs.CG2017

The well-separated pair decomposition for balls

Abolfazl Poureidi, Mohammad Farshi

Given a real number $t > 1$ , a geometric $t$ -spanner is a geometric graph for a point set in $R^{d}$ with straight lines between vertices such that the ratio of the shortest-p…

On [1,2]-Domination in Interval and Circle Graphs

The well-separated pair decomposition for balls

On $[1, 2]$ -Domination in Interval and Circle Graphs