Title

Extremal connected graphs for independent domination number

Authors

Authors

R. C. Brigham; J. R. Carrington;R. P. Vitray

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Discret. Math.

Keywords

domination; independent domination number; total matching; extremal; IRREDUNDANCE; PARAMETERS; Mathematics

Abstract

A general characterization of connected graphs on n vertices having the maximum possible independent domination number of [n + 2 - 2rootn] is given. This result leads to a structural characterization of such graphs in all but a small finite number of cases. For certain situations, one of which occurs when n is a perfect square, the extremal graphs have a particularly simple structure. (C) 2003 Published by Elsevier B.V.

Journal Title

Discrete Mathematics

Volume

275

Issue/Number

1-3

Publication Date

1-1-2004

Document Type

Article

Language

English

First Page

299

Last Page

309

WOS Identifier

WOS:000187915100020

ISSN

0012-365X

Share

COinS