◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Boram Park

1 paper hereh-index 12542 citations74 works total

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • math.CO1
same name
  • Boram Park — 2 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedThe competition numbers of Hamming graphs with diameter at most three

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

collaborators

1 paper

math.CO2010★ 13 cited

The competition numbers of Hamming graphs with diameter at most three

Boram Park, Yoshio Sano

The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (…

◍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.