Peter Dankelmann

From MaRDI portal
Person:233440

Available identifiers

zbMath Open dankelmann.peterWikidataQ102110912 ScholiaQ102110912MaRDI QIDQ233440

List of research outcomes

PublicationDate of PublicationType
The oriented diameter of graphs with given connected domination number and distance domination number2024-02-15Paper
Edge-fault diameter of \(C_4\)-free graphs2023-10-30Paper
Oriented diameter of maximal outerplanar graphs2023-10-04Paper
On the Wiener index of orientations of graphs2023-06-05Paper
Proximity, remoteness and maximum degree in graphs2023-05-31Paper
On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs2023-03-13Paper
Diameter of orientations of graphs with given order and number of blocks2022-12-14Paper
Proximity in triangulations and quadrangulations2022-11-29Paper
Wiener index in graphs with given minimum degree and maximum degree2022-09-30Paper
On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs2022-09-15Paper
The maximum average connectivity among all orientations of a graph2022-04-13Paper
Wiener index, number of subtrees, and tree eccentric sequence2021-11-15Paper
Size of graphs and digraphs with given diameter and connectivity constraints2021-08-03Paper
Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree2021-07-08Paper
Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence2021-06-25Paper
Steiner diameter, maximum degree and size of a graph2021-06-14Paper
Proof of a conjecture on the Wiener index of Eulerian graphs2021-06-14Paper
On average distance in tournaments and Eulerian digraphs2021-05-19Paper
Average eccentricity, minimum degree and maximum degree in graphs2021-05-03Paper
Wiener Index and Remoteness in Triangulations and Quadrangulations2021-05-03Paper
Distances in graphs of girth 6 and generalised cages2021-03-17Paper
A size condition for diameter two orientable graphs2021-03-17Paper
Distance domination and generalized eccentricity in graphs with given minimum degree2020-05-21Paper
Upper Bounds on the average eccentricity of Graphs of Girth $6$ and $(C_4$, $C_5)$-free Graphs2020-04-29Paper
On the edge-connectivity of C_4-free graphs2019-11-08Paper
Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs2019-11-06Paper
The Steiner \(k\)-Wiener index of graphs with given minimum degree2019-09-19Paper
Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs2019-06-06Paper
Average eccentricity, \(k\)-packing and \(k\)-domination in graphs2019-03-25Paper
A degree condition for diameter two orientability of graphs2019-02-20Paper
Oriented diameter of graphs with given maximum degree2018-07-13Paper
https://portal.mardi4nfdi.de/entity/Q45763382018-07-12Paper
https://portal.mardi4nfdi.de/entity/Q45662352018-06-14Paper
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension2018-04-20Paper
The degree-diameter problem for outerplanar graphs2017-07-17Paper
New bounds on proximity and remoteness in graphs2017-06-28Paper
On the eccentric connectivity index and Wiener index of a graph2017-03-20Paper
https://portal.mardi4nfdi.de/entity/Q28160752016-07-01Paper
Diameter and maximum degree in Eulerian digraphs2016-01-21Paper
On the number of resolving pairs in graphs2015-12-17Paper
Maximally edge-connected hypergraphs2015-10-08Paper
Diameter of orientations of graphs with given minimum degree2015-06-18Paper
Proximity, remoteness and minimum degree2015-04-28Paper
Steiner diameter of 3, 4 and 5-connected maximal planar graphs2014-12-03Paper
Distance and size in digraphs2014-11-07Paper
https://portal.mardi4nfdi.de/entity/Q28760212014-08-15Paper
A characterization of graphs by codes from their incidence matrices2014-08-14Paper
Upper bounds on the average eccentricity2014-03-27Paper
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs2014-01-28Paper
A note on extremal values of the scattering number2013-11-29Paper
Codes from incidence matrices of graphs2013-05-30Paper
Eccentric counts, connectivity and chordality2013-03-21Paper
The radius of \(k\)-connected planar graphs with bounded faces2012-11-20Paper
https://portal.mardi4nfdi.de/entity/Q29100202012-09-07Paper
Upper bounds on the Steiner diameter of a graph2012-08-14Paper
Automorphism group and diameter of a graph2012-06-04Paper
Average distance in weighted graphs2012-01-11Paper
On the distance distribution of trees2011-06-28Paper
Hamiltonicity of \(k\)-traceable graphs2011-06-01Paper
Degree distance of unicyclic and bicyclic graphs2011-05-17Paper
The number of edges in a bipartite graph of given radius2011-05-06Paper
The diameter of almost Eulerian digraphs2010-12-16Paper
Average distance and generalised packing in graphs2010-10-11Paper
Minimum size of a graph or digraph of given radius2010-08-20Paper
https://portal.mardi4nfdi.de/entity/Q35614262010-05-25Paper
On the degree distance of a graph2010-04-28Paper
On complexity of minimum leaf out-branching problem2010-04-28Paper
Average distance and vertex-connectivity2009-12-18Paper
Domination with exponential decay2009-12-15Paper
Inverse degree and edge-connectivity2009-12-09Paper
A linear-time algorithm to compute a MAD tree of an interval graph2009-07-09Paper
The edge-Wiener index of a graph2009-06-23Paper
Diameter of 4-colourable graphs2009-06-17Paper
Minimal claw-free graphs2009-05-06Paper
https://portal.mardi4nfdi.de/entity/Q36249762009-05-06Paper
Average Distance and Edge-Connectivity I2009-03-16Paper
Average Distance and Edge-Connectivity II2008-12-05Paper
Embedding graphs as isometric medians2008-09-29Paper
https://portal.mardi4nfdi.de/entity/Q54421742008-02-22Paper
Diameter and inverse degree2008-02-14Paper
On equality in an upper bound for the restrained and total domination numbers of a graph2007-11-27Paper
On the connectivity of diamond-free graphs2007-09-21Paper
https://portal.mardi4nfdi.de/entity/Q34088422006-11-15Paper
https://portal.mardi4nfdi.de/entity/Q34088532006-11-15Paper
Simultaneous graph parameters: factor domination and factor total domination2006-10-19Paper
https://portal.mardi4nfdi.de/entity/Q54883482006-09-14Paper
Trees with equal domination and restrained domination numbers2006-06-26Paper
https://portal.mardi4nfdi.de/entity/Q54660282005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q54633442005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54635342005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54617022005-07-26Paper
SOME CENTRALITY RESULTS NEW AND OLD2005-05-09Paper
The diameter of directed graphs2005-05-04Paper
Minimum average distance of strong orientations of graphs2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q48261692004-11-11Paper
Maximum sizes of graphs with given domination parameters2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44605642004-05-18Paper
MAD trees and distance-hereditary graphs2003-09-25Paper
Bounds on the average connectivity of a graph2003-09-09Paper
On strong distances in oriented graphs2003-06-09Paper
Factor domination and minimum degree2003-04-28Paper
Weighted domination in triangle-free graphs2002-08-29Paper
Average distance in colored graphs2002-08-28Paper
Augmenting trees so that every three vertices lie on a cycle2002-08-08Paper
https://portal.mardi4nfdi.de/entity/Q27213272001-12-10Paper
Generalized eccentricity, radius, and diameter in graphs2000-10-23Paper
https://portal.mardi4nfdi.de/entity/Q44874532000-10-18Paper
Degree sequence conditions for maximally edge-connected graphs depending on the clique number2000-07-30Paper
Average distance, minimum degree, and spanning trees2000-06-29Paper
https://portal.mardi4nfdi.de/entity/Q38425151999-05-04Paper
https://portal.mardi4nfdi.de/entity/Q43877211998-08-10Paper
Average distance and domination number1998-01-26Paper
On the average Steiner distance of graphs with presribed properties1998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43550691997-12-22Paper
The average Steiner distance of a graph1996-11-03Paper
https://portal.mardi4nfdi.de/entity/Q48566321996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48518191995-10-12Paper
On Path-Tough Graphs1994-12-20Paper
Computing the average distance of an interval graph1994-09-25Paper
Average distance and independence number1994-07-31Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Peter Dankelmann