An extended Roman domination function on a graph G=(V,E) is a function satisfying the conditions that (i) every vertex u for which f(u) is either 0 or 1 is adjacent to at least one vertex v for which f(v) =3,(ii) if u and v are two adjacent vertices and if f(u)=0 then f(v)≠0. The weight of an extended Roman domination function is the value ( ) Σ ( ) The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by ( ) . In this paper we study this variant of domination for honeycomb networks.