Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. Haviland (1995) conjectured that any connected regular graph G of order n and degree δn/2 satisfies i(G) ⩽ ⌈2n/3δδ/2. In this paper, we will settle the conjecture of Haviland in the negative by constructing counterexamples. Therefore a larger upper bound is expected. We will also show that a connected cubic graph G of order n ⩾ 8 satisfies i(G) ⩽ 2n/5, providing a new upper bound for cubic graphs.

Keywords

Independent domination number, Regular graph

Publication Date

1999

Source Publication Title

Discrete Mathematics

Volume

202

Issue

1-3

Start Page

135

End Page

144

Publisher

Elsevier

Peer Reviewed

1

DOI

10.1016/S0012-365X(98)00350-1

Link to Publisher's Edition

http://dx.doi.org/10.1016/S0012-365X(98)00350-1

ISSN (print)

1872681X

Included in

Mathematics Commons

Share

COinS