๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Independence and upper irredundance in claw-free graphs

โœ Scribed by Odile Favaron

Book ID
104294292
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
317 KB
Volume
132
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

Upper total domination in claw-free grap
Upper total domination in claw-free graphs
โœ Odile Favaron; Michael A. Henning ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 114 KB

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by ฮ“~__