𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domination game played on trees and spanning subgraphs

✍ Scribed by Brešar, Boštjan; Klavžar, Sandi; Rall, Douglas F.

Book ID
118747169
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
453 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classification of interpolation theorems
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
✍ Frank Harary; Michael J. Plantholt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

We say that a graphical invariant i of a graph interpolates over a family 8 of graphs if i satisfies the following property: If rn and M are the minimum and maximum values (respectively) of i over all graphs in 8 then for each k , rn 4 k I M , there is a graph H in 8 for which i ( H ) = k . In previ