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

Irredundance, secure domination and maximum degree in trees

โœ Scribed by E.J. Cockayne

Book ID
108113691
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
148 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
โœ B. Bollobรกs; E.J. Cockayne ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood 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 communications from X may also be irdorme

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

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