Average distance and independence number

P. Dankelmann

doi:10.1016/0166-218X(94)90095-7

Average distance and independence number

P. Dankelmann

RWTH Aachen University

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

74 Citations (Scopus)

Abstract

A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.

Original language	English
Pages (from-to)	75-83
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	51
Issue number	1-2
DOIs	https://doi.org/10.1016/0166-218X(94)90095-7
Publication status	Published - 22 Jun 1994
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/0166-218X(94)90095-7

Cite this

@article{b8f5ee3cf0444f9bbcda74587beeb7ef,

title = "Average distance and independence number",

abstract = "A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.",

author = "P. Dankelmann",

year = "1994",

month = jun,

day = "22",

doi = "10.1016/0166-218X(94)90095-7",

language = "English",

volume = "51",

pages = "75--83",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Average distance and independence number

AU - Dankelmann, P.

PY - 1994/6/22

Y1 - 1994/6/22

N2 - A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.

AB - A sharp upper bound on the average distance of a graph depending on the order and the independence number is given. As a corollary we obtain the maximum average distance of a graph with given order and matching number. All extremal graphs are determined.

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

U2 - 10.1016/0166-218X(94)90095-7

DO - 10.1016/0166-218X(94)90095-7

M3 - Article

AN - SCOPUS:0009911881

SN - 0166-218X

VL - 51

SP - 75

EP - 83

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -

Average distance and independence number

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this