Document Type : Research Paper
Faculty of Chemistry and Chemical Engineering, Babes-Bolyai University, Arany Janos Str. 11, 400084, Cluj, Romania
Department of Mathematics, Faculty of Science, University of Kashan, Kashan, I. R. Iran
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.