✦ LIBER ✦

Independence and domination in polygon graphs

✍ Scribed by Ehab S. Elmallah; Lorna K. Stewart

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 876 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90222-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized independence and domination

Generalized independence and domination in graphs

✍ Mieczysław Borowiecki; Danuta Michalak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The purpose of this paper is to introduce various concepts of g?-domination, which generalize and unify different well-known kinds of domination in graphs. We generalize a result of Lov/tsz concerning the existence of a partition of a set of vertices of G into independent subsets and a result of Fav

Independence and hamiltonicity in 3-domi

Independence and hamiltonicity in 3-domination-critical graphs

✍ Favaron, Odile; Tian, Feng; Zhang, Lei 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 3 views

Let δ, γ, i and α be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-γ-critical if γ = 3 and the addition of any edge decreases γ by 1. It was conjectured that any connected 3-γ-critical graph satisf

k-Domination andk-Independence in Graphs

k-Domination andk-Independence in Graphs: A Survey

✍ Mustapha Chellali; Odile Favaron; Adriana Hansberg; Lutz Volkmann 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 641 KB

Chordal graphs and upper irredundance, u

Chordal graphs and upper irredundance, upper domination and independence

✍ Michael S. Jacobson; Ken Peters 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of

Independent domination in chordal graphs

✍ Martin Farber 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Independent domination in regular graphs

✍ Julie Haviland 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th