๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

โœ Scribed by Cai, Leizhen; Cheng, Yongxi; Verbin, Elad; Zhou, Yuan

Book ID
118197129
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
463 KB
Volume
24
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A spectral lower bound for the treewidth
A spectral lower bound for the treewidth of a graph and its consequences
โœ L.Sunil Chandran; C.R. Subramanian ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v

On the Isomorphism Problem for Finite Ca
On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency
โœ C.H. Li; C.E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

For a subset S of a group G such that 1 / โˆˆ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 โˆˆ S. Each ฯƒ โˆˆ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S ฯƒ ). For a positive integer m, th