On the independent domination number of graphs with given minimum degree

N. I. Glebov; A. V. Kostochka

doi:10.1016/S0012-365X(97)00267-7

On the independent domination number of graphs with given minimum degree

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

Abstract

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).

Original language	English (US)
Pages (from-to)	261-266
Number of pages	6
Journal	Discrete Mathematics
Volume	188
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(97)00267-7
State	Published - Jun 28 1998
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Online availability

10.1016/S0012-365X(97)00267-7

Library availability

Discover UIUC Full Text

Cite this

@article{f3fbdd2dadee49039ab260f759ebdcac,

title = "On the independent domination number of graphs with given minimum degree",

abstract = "We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).",

author = "Glebov, {N. I.} and Kostochka, {A. V.}",

note = "Funding Information: * Corresponding author. E-mail: sasha@math.nsc.ru. l This work was partially supported by the grant 96-01-01591 of the Russian Foundation for Fundamental Research. 2 This work was partially supported by the grants 96-01-01614 and 97-01-01075 of the Russian Foundation for Fundamental Research and by the Network DIMANET of the European Union.",

year = "1998",

month = jun,

day = "28",

doi = "10.1016/S0012-365X(97)00267-7",

language = "English (US)",

volume = "188",

pages = "261--266",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On the independent domination number of graphs with given minimum degree

AU - Glebov, N. I.

AU - Kostochka, A. V.

N1 - Funding Information: * Corresponding author. E-mail: sasha@math.nsc.ru. l This work was partially supported by the grant 96-01-01591 of the Russian Foundation for Fundamental Research. 2 This work was partially supported by the grants 96-01-01614 and 97-01-01075 of the Russian Foundation for Fundamental Research and by the Network DIMANET of the European Union.

PY - 1998/6/28

Y1 - 1998/6/28

N2 - We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).

AB - We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case δ = 2 of the corresponding conjecture by Favaron (1988).

UR - http://www.scopus.com/inward/record.url?scp=0042785355&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042785355&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(97)00267-7

DO - 10.1016/S0012-365X(97)00267-7

M3 - Article

AN - SCOPUS:0042785355

SN - 0012-365X

VL - 188

SP - 261

EP - 266

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On the independent domination number of graphs with given minimum degree

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this