In this note, we give an infinite family of optimal graphs called G⁺(d,c). They are optimal in the sense that they have the maximum possible number of vertices for given a diameter d and the so-called `outer multiset dimension' c. We provide their spectra, which have the property that their Laplacian eigenvalues are all different and integral. Finally, we also obtained their eigenvectors.
No takes yet. Share an insight, caveat, or question.
Dalfó et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: