In this paper we build a family of hierarchical graphs based on the triangle (Sierpi\'{n}ski gasket-based graphs) and calculate their important characteristics, such as average degree, average shortest path length, small-world graph family characteristics. Then we present stream ciphers defined on a finite automaton corresponding to this family.