✦ LIBER ✦

Clustering and domination in perfect graphs

✍ Scribed by D.G. Corneil; Y. Perl

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 793 KB
Volume: 9
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90088-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent perfect domination sets in C

Independent perfect domination sets in Cayley graphs

✍ Jaeun Lee 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

Perfect Matchings in Total Domination Cr

Perfect Matchings in Total Domination Critical Graphs

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 249 KB

Upper domination and upper irredundance

Upper domination and upper irredundance perfect graphs

✍ Gregory Gutin; Vadim E. Zverovich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Let /~(G), F(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called In this paper, we present a characterization of F-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of F-p

A characterization of domination perfect

A characterization of domination perfect graphs

✍ I. E. Zverovich; V. E. Zverovich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Let u(G) and i(G) be the domination number and independent domination number of a graph G. respectively. Sumner and Moore [8] define a graph G to be domination perfect if y( H) = i( H), for every induced subgraph H of G. In this article, we give a finite forbidden induced subgraph characterization o

Weighted independent perfect domination

Weighted independent perfect domination on cocomparability graphs

✍ Gerard J. Chang; C.Pandu Rangan; Satyan R. Coorg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 542 KB

An induced subgraph characterization of

An induced subgraph characterization of domination perfect graphs

✍ Igor E. Zvervich; Vadim E. Zverovich 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

## Abstract Let γ(__G__) ι(__G__) be the domination number and independent domination number of a graph (__G__), respectively. A graph (__G__) is called domination perfect if γ(__H__) = ι(__H__), for every induced subgraph __H__ of (__G__). There are many results giving a partial characterization o