Trees with two disjoint minimum independent dominating sets

Teresa W. Haynes; Michael A. Henning

doi:10.1016/j.disc.2005.09.012

Trees with two disjoint minimum independent dominating sets

Teresa W. Haynes, Michael A. Henning

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

15 Citations (Scopus)

Abstract

The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.

Original language	English
Pages (from-to)	69-78
Number of pages	10
Journal	Discrete Mathematics
Volume	304
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2005.09.012
Publication status	Published - 28 Nov 2005
Externally published	Yes

Keywords

Independent domination number
Trees

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2005.09.012

Cite this

@article{0551579ad88b44e997b6890db116a873,

title = "Trees with two disjoint minimum independent dominating sets",

abstract = "The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.",

keywords = "Independent domination number, Trees",

author = "Haynes, {Teresa W.} and Henning, {Michael A.}",

year = "2005",

month = nov,

day = "28",

doi = "10.1016/j.disc.2005.09.012",

language = "English",

volume = "304",

pages = "69--78",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Trees with two disjoint minimum independent dominating sets

AU - Haynes, Teresa W.

AU - Henning, Michael A.

PY - 2005/11/28

Y1 - 2005/11/28

N2 - The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.

AB - The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets.

KW - Independent domination number

KW - Trees

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

U2 - 10.1016/j.disc.2005.09.012

DO - 10.1016/j.disc.2005.09.012

M3 - Article

AN - SCOPUS:27944504790

SN - 0012-365X

VL - 304

SP - 69

EP - 78

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Trees with two disjoint minimum independent dominating sets

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this