Trees with two disjoint minimum independent dominating sets

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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. © 2005 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Haynes, T. W., & Henning, M. A. (2005). Trees with two disjoint minimum independent dominating sets. Discrete Mathematics, 304(1–3), 69–78. https://doi.org/10.1016/j.disc.2005.09.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free