## Abstract We consider graphs __G = (V,E)__ with order ρ = |__V__|, size __e__ = |__E__|, and stability number β~0~. We collect or determine upper and lower bounds on each of these parameters expressed as functions of the two others. We prove that all these bounds are sharp. © __1993 by John Wiley
✦ LIBER ✦
Jumping numbers and ordered tree structures on the dual graph
✍ Scribed by Eero Hyry; Tarmo Järvilehto
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 266 KB
- Volume
- 136
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Sharp bounds on the order, size, and sta
✍
Pierre Hansen; Maolin Zheng
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 276 KB
The core of games on ordered structures
✍
Michel Grabisch
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 639 KB
On the numbers of spanning trees and Eul
✍
Xueliang Li; Fuji Zhang
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 756 KB
On the crossing numbers of products of c
✍
Lowell W. Beineke; Richard D. Ringeisen
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 446 KB
On the Crossing Numbers of Products of S
✍
Marián Klešč
📂
Article
📅
2001
🏛
Springer Japan
🌐
English
⚖ 111 KB
On the structure and stability number of
✍
Andreas Brandstädt; Raffaele Mosca
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 336 KB
We give a O(nm) time algorithm for the maximum weight stable set (MWS) problem on P5-and co-chair-free graphs without recognizing whether the (arbitrary) input graph is P5and co-chair-free. This algorithm is based on the fact that prime P5-and co-chair-free graphs containing 2K2 are matched co-bipar