Caleb Westfall

Gaps Below n in Multiset Resolving Spectra

A set S of vertices of a connected graph is multiset resolving if every vertex has a distinct multiset of distances to S. We study graphs whose identification spectrum (the set of sizes of multiset resolving sets) contains the order n but skips the sizes just below it, and define the top gap g(G) as n minus the largest...