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

Independent dominating sets in triangle-free graphs

โœ Scribed by Wayne Goddard; Jeremy Lyle


Publisher
Springer US
Year
2010
Tongue
English
Weight
439 KB
Volume
23
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Independent sets in graphs with triangle
โœ Thomas Hofmeister; Hanno Lefmann ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB
Triangles and Neighbourhoods of Independ
โœ 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.

Dominating Sets in Planar Graphs
โœ Lesley R. Matheson; Robert E. Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 174 KB
Independent perfect domination sets in C
โœ 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