Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks

نویسندگان
Pop, Monica L. ID 1
Gholami-Nezhaad, F. ID 2
Ashrafi, A. R. ID 3
Diudea, Mircea V. ID 4
Nagy, Katalin ID 5

1 Faculty of Chemistry and Chemical Engineering, Babes-Bolyai University, Arany Janos Str. 11, 400084, Cluj, Romania

2 Department of Mathematics, Faculty of Science, University of Kashan, Kashan, I. R. Iran

3 Department of Mathematics, Faculty of Science, University of Kashan, Kashan, I. R. Iran

4 Faculty of Chemistry and Chemical Engineering, Babes-Bolyai University, Arany Janos Str. 11, 400084, Cluj, Romania

5 Faculty of Chemistry and Chemical Engineering, Babes-Bolyai University, Arany Janos Str. 11, 400084, Cluj, Romania

doi
چکیده

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.

کلیدواژه‌ها
Dyck Graphs, Omega Polynomial, PIv Polynomial, Net Operation