◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Vibhav Oswal

1 paper hereh-index 12 citations1 works total

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

author position
  • last author1

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

fields
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedOn the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs

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

collaborators

1 paper

math.CO2021★ 2 cited

On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs

Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal

Let G be a graph of order n and let u,v be vertices of G. Let κG​(u,v) denote the maximum number of internally disjoint u-v paths in G. Then the average connectivit…

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