Omega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Authors
Abstract:
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.
similar resources
omega and piv polynomial in dyck graph-like z(8)-unit networks
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.
full textOmega Polynomial in Polybenzene Multi Tori
The polybenzene units BTX 48, X=A (armchair) and X=Z (zig-zag) dimerize forming “eclipsed” isomers, the oligomers of which form structures of five-fold symmetry, called multi-tori. Multi-tori can be designed by appropriate map operations. The genus of multi-tori was calculated from the number of tetrapodal units they consist. A description, in terms of Omega polynomial, of the two linearly peri...
full textOmega Polynomial
A new counting polynomial, called the “Omega” Ω(G, x) polynomial, is proposed on the ground of quasi-orthogonal cut “qoc” edge strips in a bipartite lattice. Within a qoc not all cut edges are necessarily orthogonal, meaning not all are pairwise codistant. Two topological indices: CI (Cluj-Ilmenau), eventually equal to the well-known PI index, in planar, bipartite graphs and IΩ are defined on t...
full textNote on Omega Polynomial
Omega polynomial, counting opposite edge strips ops, was proposed by Diudea to describe cycle-containing molecular structures, particularly those associated with nanostructures. In this paper, some theoretical aspects are evidenced and particular cases are illustrated.
full textEvery 3-connected claw-free Z8-free graph is Hamiltonian
In this article, we first show that every 3-edge-connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3-connected claw-free graph without Z8 as an induced subgraph is Hamiltonian, where Z8 denotes the graph derived from identifying one end vertex of P9 (a path with 9 vertices) with one vertex of a triangle. The above two results are both best possi...
full textComputing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes
The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G) euv nu (e) nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...
full textMy Resources
Journal title
volume 6 issue 2
pages 97- 103
publication date 2010-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023