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

Domination and irredundance in cubic graphs

โœ Scribed by E.J. Cockayne; C.M. Mynhardt

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
552 KB
Volume
167-168
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

Stability, domination and irredundance i
Stability, domination and irredundance in a graph
โœ Odile Favaron ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 441 KB

In a graph G, a set X is called a stable set if any two vertices of X are nonadjacent. A set X is called a dominating set if every vertex of V-X is joined to at least one vertex of X. A set Xis called an irredundant set if every vertex of X, not isolated in X, has at least one proper neighbor, that

Domination and irredundance in the queen
Domination and irredundance in the queens' graph
โœ A.P Burger; E.J Cockayne; C.M Mynhardt ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1020 KB

The vertices of the queem;' graph {~, are the squares of an n ร— n chessboard and two squares are adjacent ifa queen placed on one covers the other. It is shown that the domination num;~'r of Q. is at most 31n/54 + O(1), that Q. possesses minimal dominating sets of cardina~tty 5n/2 -O(l) and that the

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

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