473 citations · 514 across the 23 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 1 cited
Zero Forcing sets and Power Dominating sets of cardinality at most 2
Najibeh Shahbaznejad, Ignacio M. Pelayo, Adel P. Kazemi
Let be a set of vertices of a graph . Let be the set of vertices built from , by iteratively applying the following propagation rule: if a vertex and all but exac…
math.CO2019★ 5 cited
The Neighbor-Locating-Chromatic Number of Pseudotrees
Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2
A -coloring of a graph is a partition of the set of vertices of into independent sets, which are called colors. A -coloring is neighbor-locating if any two vertic…