◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Dankelmann

25 papers hereh-index 252.1k citations134 works total

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

author position
  • sole author4
  • first author12
  • middle author7
  • last author2

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

fields
  • math.CO24
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20082026
most citedBounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension

12 citations · 42 across the 21 of their papers we have counts for

collaborators
Showing 2024 · math.COShow all

3 papers · 2 filters

math.CO2024

Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph

Peter Dankelmann

In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between…

math.CO2024

On the Edge-Connectivity of the Square of a Graph

Camino Balbuena, Peter Dankelmann

Let G be a connected graph. The edge-connectivity of G, denoted by λ(G), is the minimum number of edges whose removal renders G disconnected. Let δ(G) be the minimum degr…

math.CO2024

Remoteness of graphs with given size and connectivity constraints

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let G be a finite, simple connected graph. The average distance of a vertex v of G is the arithmetic mean of the distances from v to all other vertices of G. The remotene…

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