Displaying similar documents to “Largest minimal percolating sets in hypercubes under 2-bootstrap percolation.”

Edge domination in graphs of cubes

Bohdan Zelinka (2002)

Czechoslovak Mathematical Journal

Similarity:

The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the n -dimensional cube Q n .

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2015)

Annales UMCS, Mathematica

Similarity:

Let G1 and G2 be two given graphs. The Ramsey number R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or Ḡ contains a G2. Parsons gave a recursive formula to determine the values of R(Pn,K1,m), where Pn is a path on n vertices and K1,m is a star on m+1 vertices. In this note, we study the Ramsey numbers R(Pn,K1,m), where Pn is a linear forest on m vertices. We determine the exact values of R(Pn,K1∨Fm) for the cases m ≤ n and m ≥ 2n, and...

Antichains of multisets.

Kilibarda, Goran, Jovović, Vladeta (2004)

Journal of Integer Sequences [electronic only]

Similarity: