Minimum 2-percolating sets in 2-connected, diameter 2 graphs
From MaRDI portal
Cites work
- 3-neighbor bootstrap percolation on grids
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- \(P_3\)-hull number of graphs with diameter two
- A note on large graphs of diameter two and given maximum degree
- A survey on the missing Moore graph
- Bootstrap percolation in high dimensions
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation on the hypercube
- Bootstrap percolation on the random regular graph
- Bootstrap percolation via automated conjecturing
- Contagious sets in dense graphs
- Deterministic bootstrap percolation on trees
- Dynamic cage survey
- Extension of strongly regular graphs
- Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three
- Extremal bounds for bootstrap percolation in the hypercube
- Geometric realisation of the graphs of McKay-Miller-Širáň
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3880742 (Why is no real title available?)
- scientific article; zbMATH DE number 3438906 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Intersecting families of permutations
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Lower bounds for graph bootstrap percolation via properties of polynomials
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
- Moore graphs and beyond: a survey of the degree/diameter problem
- New bounds for contagious sets
- On a family of strongly regular graphs with = 1
- On Moore Graphs with Diameters 2 and 3
- On the P₃-hull number of Hamming graphs
- On the \(P_3\)-hull number of Kneser graphs
- On the \(P_3\)-hull number of some products of graphs
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs
- On the clique number of Paley graphs of prime power order
- Ore and Chvátal-type degree conditions for bootstrap percolation from small sets
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
- Random disease on the square grid
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Smallest percolating sets in bootstrap percolation on grids
- The complementary product of two graphs
- The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
- The sharp threshold for bootstrap percolation in all dimensions
This page was built for publication: Minimum 2-percolating sets in 2-connected, diameter 2 graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858825)