R. Naserasr

activity

20102026

most citedIdentification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity

43 citations · 237 across the 31 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Homomorphisms of signed graphs: An update

Reza Naserasr, Eric Sopena, Thomas Zaslavsky

A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of neg…

math.CO2019

On the Structure of Small Strength- $2$ Covering Arrays

Janne I. Kokkala, Karen Meagher, Reza Naserasr +3

A covering array $CA (N; t, k, v)$ of strength $t$ is an $N \times k$ array of symbols from an alphabet of size $v$ such that in every $N \times t$ subarray, every $t$ -tuple occur…

Homomorphisms of signed graphs: An update

On the Structure of Small Strength-2 Covering Arrays

On the Structure of Small Strength- $2$ Covering Arrays