"Resolvability of Hamming Graphs."

Lucas Laird et al. (2020)

> Home

Details and statistics

DOI: 10.1137/19M1274511

access: closed

type: Journal Article

metadata version: 2021-01-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/LairdTBL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/LairdTBL20
Lucas Laird, Richard C. Tillquist, Stephen Becker, Manuel E. Lladser:
Resolvability of Hamming Graphs. SIAM J. Discret. Math. 34(4): 2063-2081 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.