This paper mainly discusses the zero forcing density of infinite
graphs. When

is an infinite graph, arrange all distinct
finite subgraphs of G in a sequence

The
zero
forcing density of

is defined by

where

is the zero forcing
number of

When

then we define the
second
density as

Considering the eleven
Archimedean tiling graphs, we get upper bounds of zero forcing
density of the tilings

,

. The zero forcing density
of the other six graphs is

Then we obtain upper bounds of the
second density of these six Archimedean tiling graphs.