arXiv (All)
open access
Minimum Contagious Sets in Trees with Degree-Proportional Thresholds
We investigate how large the minimum size of a contagious set can be among trees of a fixed order. Given a graph $G$ and $ρ\in[0,1]$, an inactive vertex $u$ becomes active when at least $\lceil{ρd_G(u)\rceil}$ of its neighbors are active. An initial set of active vertices is contagious if the proc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Secure Domination in Odd-order Sierpinski Graphs#1412194
- Treewidth and the Product of Tree-Independence and Tree-Chromatic Numbers#1355331
- Approximate Itai–Zehavi conjecture for random graphs#1367261
- Limits of descent-biased trees#1109458
- Stochastic epidemic models on random networks: casual contacts, clustering and vaccination#649219
Record · ID 1459268
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive