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

Irredundant and perfect neighbourhood sets in trees

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

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
373 KB
Volume
188
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

For any tree T, it is proved that 0(T), the smallest cardinality of a perfect neighbourhood set, is bounded above by ir(T), the smallest cardinality of a maximal irredundant set.

๐Ÿ“œ SIMILAR VOLUMES

Triangles and Neighbourhoods of Independ
Triangles and Neighbourhoods of Independent Sets in Graphs
โœ Andrew M. Robertshaw; Douglas R. Woodall ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

It is proved that a graph of order n contains a triangle if |N(X )| > 1 3 (n+|X |) for every independent set X of vertices. This bound is sharp.

Perfect pairs of trees in graphs
Perfect pairs of trees in graphs
โœ Ladislav Novak; Alan Gibbons ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 392 KB
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