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

Unique irredundance, domination and independent domination in graphs

โœ Scribed by Miranca Fischermann; Lutz Volkmann; Igor Zverovich

Book ID
108113562
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
199 KB
Volume
305
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Graph-theoretic parameters concerning do
Graph-theoretic parameters concerning domination, independence, and irredundance
โœ B. Bollobรกs; E. J. Cockayne ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 402 KB

## Abstract A vertex __x__ in a subset __X__ of vertices of an undericted graph is __redundant__ if its closed neighbourhood is contained in the union of closed neighborhoods of vertices of __X__ โ€“ {__x__}. In the context of a communications network, this means that any vertex that may receive comm

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

Domination critical graphs with higher i
Domination critical graphs with higher independent domination numbers
โœ Ao, S.; Cockayne, E.J.; MacGillivray, G.; Mynhardt, C.M. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 348 KB ๐Ÿ‘ 2 views

We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch ( J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3.