A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m
✦ LIBER ✦
On a class of graphs between threshold and total domishold graphs
✍ Scribed by Chiarelli, Nina; Milanič, Martin
- Book ID
- 122308352
- Publisher
- Elsevier Science
- Year
- 2015
- Tongue
- English
- Weight
- 523 KB
- Volume
- 195
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A class of threshold and domishold graph
✍
Charles Payan
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 484 KB
Structure and recognition of domishold g
✍
P. Marchioro; A. Morgana
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 698 KB
Graph Classes: A Survey || 13. Threshold
✍
Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy P.
📂
Article
📅
1999
🏛
Society for Industrial and Applied Mathematics
⚖ 115 KB
Total matchings and total coverings of t
✍
Uri Peled; Feng Sun
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 423 KB
Class-reconstruction of total graphs
✍
David W. Bange; Anthony E. Barkauskas; Linda H. Host
📂
Article
📅
1987
🏛
John Wiley and Sons
🌐
English
⚖ 533 KB
It is shown that given any vertex-deleted total graph, every reconstruction into a total graph by the addition of a vertex yields the original total graph. The proof indicates how the reconstruction can be done. Hu, for i = 1 , . . . , p , then G Definition. Let C be a class of graphs. A graph G E C
On Dissemination Thresholds in Regular a
✍
I. Rapaport; K. Suchan; I. Todinca; J. Verstraete
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 497 KB