𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the independence number of distance graphs with vertices in {−1, 0, 1}n

✍ Scribed by A. É. Guterman; V. K. Lyubimov; A. M. Raigorodskii; S. A. Usachev


Book ID
110149634
Publisher
SP MAIK Nauka/Interperiodica
Year
2009
Tongue
English
Weight
522 KB
Volume
86
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the independence number in K1, r+1-fr
✍ Zdeněk Ryjáček; Ingo Schiermeyer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.