13 citations · 36 across the 28 of their papers we have counts for
1 paper · 2 filters
Minghui Jiang
An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density o…