A set S ⊆ V (G) is said to be secure if for every X ⊆ S, |N[X]∩S|⩾ |N[X]−S| holds. If set S is secure dominating, then the set must hold both secure and dominating conditions. The secure domination number of G is the minimum cardinality of a secure dominating set in G. Silicate are the inorganic compounds and rock-forming minerals. The basic unit of silicates are tetrahedron (SiO4). In this paper we have obtained results on secure domination number of silicate chains, silicate network and line graph of silicate chains.