2 papers
math.CO2020
Maker-Breaker resolving game
Cong X. Kang, Sandi Klavžar, Ismael G. Yero +1
A set of vertices of a graph is a resolving set if every vertex of is uniquely determined by its vector of distances to . In this paper, the Maker-Breaker resolving…
math.CO2019
On Laplacian Monopoles
Cong X. Kang, Gretchen L. Matthews, Justin D. Peachey
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly…