In this section, we present an analytical computation of some vertex versions of distance-based topological descriptors for molecular sieve hexagonal mesh . We used Matlab version 2019 software for analytical computation and also used Flash 8 to construct molecular structure in this study.
Theorem 1. Let G be a molecular sieve hexagonal mesh . Then
.
Proof. Let G be a molecular sieve hexagonal mesh . Here the total number of vertices of G is denoted and the total number of edges of G is denoted . The graph G that may be isometrically embedded into a hypercube is called a partial cube. Bipartite graphs with transitive Djoković–Winkler relation or cut method can be used to describe partial cubes. Let -class be the transitive closure of the Djoković–Winkler relation .
Throughout this paper, we discussed two types of
-classes
and
on
G, where
are depicted in
Figure 3. We show different directions of
-classes
on
in
Figure 4. By applying
on
G,
G is converted to quotient graphs
Q, which is a complete bipartite graph
(see
Figure 5). Let
and let
denotes the number of cut edges in
G. To complete the analytical computation by using all mentioned
-classes (see
Figure 4), we now divide the
-classes of
G into two cases.
Case (i): on G; , .
For , , the vertex-weighted , and the strength-weighted values on vertices of Q are defined below:
, where .
Case (ii): on G; , , and
For , , the vertex-weighted , and strength-weighted values on vertices of Q are defined below:
where
By symmetry, we have
and
, and
(see
Figure 4). Define,
, where and when , , for .
.
Further, an analytical computation of and yields the results of Theorem 1. □