On the distance distribution of trees

Peter Dankelmann

doi:10.1016/j.dam.2011.02.010

On the distance distribution of trees

Peter Dankelmann

University of KwaZulu-Natal

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

Let G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter.

Original language	English
Pages (from-to)	945-952
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	159
Issue number	10
DOIs	https://doi.org/10.1016/j.dam.2011.02.010
Publication status	Published - 28 Jun 2011
Externally published	Yes

Keywords

Diameter
Distance
Distance distribution
Radius
Tree

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2011.02.010

Cite this

@article{7eb35753e3c84f1f997b0272232a7e5d,

title = "On the distance distribution of trees",

abstract = "Let G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter.",

keywords = "Diameter, Distance, Distance distribution, Radius, Tree",

author = "Peter Dankelmann",

year = "2011",

month = jun,

day = "28",

doi = "10.1016/j.dam.2011.02.010",

language = "English",

volume = "159",

pages = "945--952",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "10",

}

TY - JOUR

T1 - On the distance distribution of trees

AU - Dankelmann, Peter

PY - 2011/6/28

Y1 - 2011/6/28

N2 - Let G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter.

AB - Let G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter.

KW - Diameter

KW - Distance

KW - Distance distribution

KW - Radius

KW - Tree

UR - https://www.scopus.com/pages/publications/79955481517

U2 - 10.1016/j.dam.2011.02.010

DO - 10.1016/j.dam.2011.02.010

M3 - Article

AN - SCOPUS:79955481517

SN - 0166-218X

VL - 159

SP - 945

EP - 952

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 10

ER -

On the distance distribution of trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this