A characterization of i-excellent trees

Teresa W. Haynes; Michael A. Henning

doi:10.1016/S0012-365X(01)00274-6

A characterization of i-excellent trees

Teresa W. Haynes
, Michael A. Henning

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

21 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. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.

Original language	English
Pages (from-to)	69-77
Number of pages	9
Journal	Discrete Mathematics
Volume	248
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(01)00274-6
Publication status	Published - 6 Apr 2002
Externally published	Yes

Keywords

Independent domination number
Trees

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(01)00274-6

Cite this

@article{38dfbb14fa5e4564b4740235f427f2e3,

title = "A characterization of i-excellent trees",

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. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.",

keywords = "Independent domination number, Trees",

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

year = "2002",

month = apr,

day = "6",

doi = "10.1016/S0012-365X(01)00274-6",

language = "English",

volume = "248",

pages = "69--77",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - A characterization of i-excellent trees

AU - Haynes, Teresa W.

AU - Henning, Michael A.

PY - 2002/4/6

Y1 - 2002/4/6

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. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.

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. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.

KW - Independent domination number

KW - Trees

UR - https://www.scopus.com/pages/publications/31244436288

U2 - 10.1016/S0012-365X(01)00274-6

DO - 10.1016/S0012-365X(01)00274-6

M3 - Article

AN - SCOPUS:31244436288

SN - 0012-365X

VL - 248

SP - 69

EP - 77

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

A characterization of i-excellent trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this