◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Christopher Raridan

2 papers here

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

author position
  • last author2

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

fields
  • math.CO2

identity via Semantic Scholar / OpenAlex

most citedOn the number of unlabeled vertices in edge-friendly labelings of graphs

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

collaborators

2 papers

math.CO2011★ 1 cited

On super edge-graceful trees of diameter four

E. Krop, F. Mutiso, C. Raridan

In "On the super edge graceful trees of even orders," Chung, Lee, Gao, and Schaffer posed the following problem: Characterize trees of diameter 4 which are super edge-graceful. In…

math.CO2011★ 2 cited

On the number of unlabeled vertices in edge-friendly labelings of graphs

Elliot Krop, Sin-Min Lee, Christopher Raridan

Let G be a graph with vertex set V(G) and edge set E(G), and f be a 0-1 labeling of E(G) so that the absolute difference in the number of edges labeled 1 and 0 is no more…

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