Independent domination in triangle-free graphs

Let G be a simple graph of order n and minimum degree δ . The independent domination number i ( G ) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. We establish upper bounds, as functions of n and δ ⩽ n / 2 , for the independent domination number of tria...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 308; no. 16; pp. 3545 - 3550
Main Author Haviland, Julie
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier B.V 28.08.2008
Elsevier
Subjects
Algebra
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Independent domination
Mathematics
Sciences and techniques of general use
Triangle-free graphs
Independent domination
Triangle-free graphs
Upper bound
Domination number
Discrete mathematics
Independent set
Combinatorics
N order
Online AccessGet full text

Cover

More Information
Summary:Let G be a simple graph of order n and minimum degree δ . The independent domination number i ( G ) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. We establish upper bounds, as functions of n and δ ⩽ n / 2 , for the independent domination number of triangle-free graphs, and over part of the range achieve best possible results.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2007.07.010