◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nathan B. Shank

9 papers hereh-index 212 citations16 works total

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

author position
  • first author1
  • middle author2
  • last author6

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

fields
  • math.CO9

identity via Semantic Scholar / OpenAlex

activity
20182025
most citedExtremal Problems Related to the Cardinality Redundance of Graphs

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

collaborators
Showing 2021Show all

3 papers · 1 filter

math.CO2021

Vertex and Mixed k-Diameter Component Connectivity

Adam Buzzard, Nathan Shank

n the k-diameter component connectivity model a network is consider operational if there is a component with diameter at least k. Therefore, a network is in a failure state if…

math.CO2021

On proportional network connectivity

Ashley Armbruster, Jieqi Di, Nicholas Hanson +1

The reliability of a network is an important parameter to consider when building a network. Different characteristics of the network can become unreliable over time or from other o…

math.CO2021

Partisan Combinatorial Game of Edge and Vertex Removal on Graphs

Nathan Shank, Devon Vukovich

We consider three variants of a partisan combinatorial game between two players, Left and Right, played on an undirected simple graph. Left is able to delete vertices (and incident…

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