On the Independent Domination Number of Regular Graphs

Authors

Wayne Goddard, Clemson UniversityFollow
Michael A. Henning, University of JohannesbergFollow
Jeremy Lyle, University of Southern MississippiFollow
Justin Southey, University of JohannesburgFollow

Document Type

Article

Publication Date

12-1-2012

Department

Mathematics

School

Mathematics and Natural Sciences

Abstract

A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.

Comments

This is an Accepted Manuscript of an article published by Taylor & Francis in 'The American Mathematical Monthly' on 12/2000, available online: http://www.tandfonline.com/10.2307/2695581.

Publication Title

Annals of Combinatorics

Volume

16

Issue

4

First Page

719

Last Page

2139

Recommended Citation

Goddard, W., Henning, M. A., Lyle, J., Southey, J. (2012). On the Independent Domination Number of Regular Graphs. Annals of Combinatorics, 16(4), 719-2139.
Available at: https://aquila.usm.edu/fac_pubs/7574