◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Lucas Laird

3 papers hereh-index 349 citations5 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author2

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.DM1
  • cs.LG1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20192025
most citedResolvability of Hamming Graphs

13 citations · 15 across the 3 of their papers we have counts for

collaborators
Showing 2019 · cs.DMShow all

1 paper · 2 filters

cs.DM2019★ 13 cited

Resolvability of Hamming Graphs

Lucas Laird, Richard C. Tillquist, Stephen Becker +1

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvab…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.