Packing of silicate and oxide networks

Abstract

An H-packing of a graph G is a set of vertex disjoint subgraphs of G, each of which is isomorphic to a fixed graph H. An F-packing is a natural generalization of H-packing concept. For a given family F of graphs, the problem is to identify a set of vertex-disjoint subgraphs of G, each isomorphic to a member of F. In this paper we give algorithms to find a perfect packing of Silicate Network SL(n),n≥1 with K1,2 and the Oxide Network OX(n),n≥1 with K1,2 and C3 and thus determine their packing numbers.