𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization and recognition of Radon-independent sets in split graphs

✍ Scribed by Dourado, Mitre C.; Rautenbach, Dieter; dos Santos, Vinícius Fernandes; Szwarcfiter, Jayme L.

Book ID
118201140
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
191 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Projectivity and independent sets in pow
Projectivity and independent sets in powers of graphs
✍ Benoit Larose; Claude Tardif 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

## Abstract We investigate the relationship between projectivity and the structure of maximal independent sets in powers of circular graphs, Kneser graphs and truncated simplices. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 162–171, 2002

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.

The number of maximal independent sets i
The number of maximal independent sets in connected graphs
✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,