Enumerating Subtrees of Flower and Sunflower Networks

Abstract

Symmetry widely exists in many complex and real-world networks, with flower networks and sunflower networks being two richly symmetric networks and having many practical applications due to their special structures. The number of subtrees (the subtree number index) is closely related to the reliable network design. Using a generating function, structural analysis techniques, and auxiliary structure introduction, this paper presents the subtree generating functions of flower networks $F{l}_{n,m}(n\ge 3,m\ge 2)$ and sunflower networks $S{f}_{n,m}(n\ge 3,m\ge 2)$ and, thus, solves the computation of subtree number indices of $F{l}_{n,m}(n\ge 3,m\ge 2)$ and $S{f}_{n,m}(n\ge 3,m\ge 2)$. The results provide a fundamental and efficient method for exploring novel features of symmetric complex cyclic networks from the structural subtree number index perspective. For instance, we conclude that under some parameter constraints, the flower networks are more reliable than sunflower networks.

1. Introduction

Local connections between the interacting system components and the dynamics of the underlying physical process can be illustrated effectively in a graph. It can also be used to illustrate the microscale channels in an aporous medium, with the vertices presenting as pores and the edges presenting as channels which connect the pores. The analysis of certain graph parameters is one of the central problems in theoretical computer science because of their extensive implicit applications; see [1,2,3,4]. Over the past few decades, a family of more than 400 topological indices (TIs) has substantially gained significance among the graph parameters. Due to their applications, TIs such as Wiener index [5,6,7], Szeged index [8,9], subtree index [10,11,12,13], and Zagreb index [14,15,16] received particular attention among these parameters. Among these structural TIs, the subtree number index of a graph (the number of all nonempty subtrees of a graph) plays a vital role in measuring the stability of a network [17], especially in the case of both vertex and edge failure. Moreover, it also presents applications in the multiple sequence parsimony alignment of pedigree trees (evolutionary trees) [18], characterizing the physio-chemical and structural characteristics of molecular graphs. According to earlier research, the well-known Wiener index, Randić index, and Harary index [19,20,21] are strongly related to the subtree number index.

It is well known that the problem of enumerating the number of subtrees of a general graph is NP complete. In fact, the problem of counting subtrees of most complex graphs has not been solved yet, except trees [11,12,13], unicyclic and bicyclic graphs [22], and regular chemical molecule [23]. In 2005, Székely et al. [10] comprehensively studied the subtree problems for trees. In 2006, Yan et al. [11] proposed an efficient linear time algorithm to enumerate subtrees of a tree using a generating function. Later, many researchers investigated the extremal problems for subtrees [24,25]. Moreover, through a weight contract and a generating function, Yang et al. [26,27,28] solved the subtree number of spiro- and polyphenyl hexagonal chains, hexagonal chain graphs, phenylene chain graphs, and tricyclic graphs. In 2018, Chin et al. [29], via generating functions, obtained the number of subtrees of complete (complete bipartite) graphs and theta graphs. More recently, in 2020, Dong et al. [17] proposed algorithms for computing the subtrees of the three-cactus network by assigning the two tuple weight to the vertices and using the technique of contracting the circle weight. In 2021, by constructing a new generating function, Yang et al. [12] proposed a new recursive (fast) algorithm to enumerate certain subtrees and BC-subtrees of the tree graph. By introducing a five tuple weight, in 2022, Abolfazl et al. [30] proposed a more efficient algorithm for computing subtrees and BC-subtrees of trees.

Symmetry is one of the core structural features of many complex and real-world networks, and it is closely related to the reliable network design; the study of symmetric complex network structures is attracting more and more attention worldwide [31,32,33]. On the other hand, the wheel graphs, flower networks, and sunflower networks are typical highly symmetric complex networks and have many practical applications due to their special structures. In 2017, Daoud [34] obtained the number of spanning trees and studied the asymptotic spanning tree properties of flower networks and sunflower networks. In 2018, Kaliraj et al. [35] obtained the star edge chromatic number of the corona product of a path with a wheel graph. In 2019, Zahid et al. [36] explored the combinatorial aspects of the spanning simplicial complex of a wheel graph. In 2020, Ali et al. [37] studied three-total edge product cordial labeling of sunflower networks. In 2022, Sathiya et al. [38] solved the equitable edge-coloring problem of wheel graphs. In the same year, Kaabar et al. [39] investigated the upper bounds of the radio number and radial radio number of sunflower-extended networks. However, there are few studies on the TIs of the sunflower networks and flower networks; moreover, it is well known that the subtree number index is closely related to the reliable network design. The key objective of this paper is to solve the subtree enumeration problem for flower networks and sunflower networks.

This paper is structured as follows: Section 2 presents notations, definitions, and lemmas. In Section 3, we started by solving the subtree generating function (SGF) of fan flower networks $FF{l}_{n,m}(n\ge 1,m\ge 2)$ and went on to solve the SGF problem of the flower networks $F{l}_{n,m}(n\ge 3,m\ge 2)$. In Section 4, through an auxiliary cyclic chain and by computing its corresponding SGF, we solved the SGF problem of sunflower networks $S{f}_{n,m}(n\ge 3,m\ge 2)$. We also briefly discussed the behavior of the subtree numbers in the flower graphs and sunflower graphs in Section 5. Lastly, we conclude our research in Section 6 and identify certain deep problems for upcoming work.

2. Terminologies and Notations

We start the section by briefly recalling the necessary notions and lemmas which will be utilized later. By $G=\left(V\right(G),E(G);f,g)$, we denote a simple graph with a vertex set V (with $\left|V\right|=n$) and an edge set E (with $\left|E\right|=m$), where f (g) is the vertex (edge) weight function. For a tree $T\in S\left(G\right)$, the weight of T is defined as $\omega \left(T\right)={\displaystyle \prod _{v\in V\left(T\right),e\in E\left(T\right)}}f\left(v\right)g\left(e\right)$. Furthermore, the generating function of G (contain vertex v) is given by $F(G;f,g)={\displaystyle \prod _{T\in S\left(G\right)}}\omega \left(T\right)$ ($F(G;f,g;v)={\displaystyle \prod _{T_s\in S(G;v)}}\omega \left(T_s\right)$). With the above notations, we denote $\eta \left(G\right)=F(G;1,1)\left(\eta \right(G;v)=F(G;1,1;v)$) as all subtrees of G (containing v) in G. Some necessary notions and notations are listed below:

• $G\backslash X$ denotes the graph produced after excluding X from G, where X may be a vertex set or an edge set, or mixed set of vertices and edges).
• $S\left(G\right)$ denotes the subtree set of G.
• $S(G,X)$ denotes the subtree set containing X in G.

Definition 1.

Let $F_{n+1}(n\ge 1)$ be the fan graph that is constructed by connecting each vertex of path $P_n=c_1{c}_2\dots c_n$ with $c_0$. Moreover, we call the graph constructed from $F_{n+1}(n\ge 1)$ the fan flower graph $FF{l}_{n,m}(n\ge 1,m\ge 2)$ (see Figure 1), by connecting each vertex pair $c_i$ and $c_0$ with a path of length $m-1$.

Definition 2.

Let $W_{n+1}$ be a wheel graph that is constructed by connecting each vertex $c_i(i=1,2,\dots ,n)$ of the n vertex unicyclic graph with a vertex $c_0$. Let $F{l}_{n,m}(n\ge 3,m\ge 2)$ (see Figure 2) be a flower network constructed by connecting each vertex pair $c_i$ and center vertex $c_0$ of $W_{n+1}$ with a path $P_{c_i{c}_0}=c_0{u}_{i,1}{u}_{i,2}{u}_{i,3}\dots u_{i,m-2}{c}_i$ of length $m-1$. It is easy to see that $F{l}_{n,m}(n\ge 3,m\ge 2)$ has $n(m+1)$ edges and $n(m-1)+1$ vertices.

Definition 3.

Let $S{f}_{n,m}(n\ge 3,m\ge 2)$ (see Figure 3) be a sunflower network that is constructed by connecting each adjacent vertex pair $c_i$ and $c_{i+1}(1\le i\le n)(c_{n+1}=c_1)$ of wheel graph $W_{n+1}$ with a path $P_{c_i{c}_{i+1}}=c_i{w}_{i,1}{w}_{i,2}{w}_{i,3}\dots w_{i,m-1}{c}_{i+1}$ of length $m-1$ sequentially. Obviously, $S{f}_{n,m}(n\ge 3,m\ge 2)$ has $n(m+1)$ edges and $n(m-1)+1$ vertices.

For the sake of brevity, we introduce some notations in the following

Table 1. Some abbreviated symbols.

Symbol	Explanation
$F_n^{c_0}$	SGF of fan flower $FF{l}_{n,m}(n\ge 1,m\ge 2)$ containing $c_0$,
	for the case of $n=0$, we let $F_0^{c_0}\left(FF{l}_{n,m}\right)=f\left(c_0\right)$
$F_{n,i}^{c_0}$	the SGF that contain both $c_0$ and path $P_i$, namely,
	$F(FF{l}_{n,m};f,g;\{c_0,P_i\})(n\ge 2,m\ge 2,2\le i\le n)$.

.

Lemma 1.

Let $T=\left(V\right(T),E(T);f,g)$ denote $n(n>1)$ a vertex-weighted tree, $v_i\in V\left(T\right)$; meanwhile, let $u\ne v_i$ be a leaf and $e=(u,v)$ be the corresponding edge of T. For the weighted tree $T^{\prime }=(V\left(T^{\prime }\right),E\left(T^{\prime }\right);f^{\prime },g^{\prime })$ with vertex set $V\left(T^{\prime }\right)=V\left(T\right)\backslash \left\{u\right\}$, edge set $E\left(T^{\prime }\right)=E\left(T\right)\backslash \left\{e\right\}$ and

$$\begin{array}{cc}\hfill f^{\prime }\left(v_s\right)& =\left\{\begin{array}{cc}f\left(v\right)(1+f(u\left)g\right(e\left)\right)\hfill & \mathit{if}{v}_s=v,\hfill \\ f\left(v_s\right)\hfill & \mathit{otherwise}.\hfill \end{array}\right.\hfill \end{array}$$

(1)

where $v_s\in V\left(T^{\prime }\right),g^{\prime }\left(e\right)=g\left(e\right)(e\in E\left(T^{\prime }\right))$. Then, we have $F(T;f,g;v_i)=F(T^{\prime };f^{\prime }{g}^{\prime };v_i)$ [11].

Lemma 2.

Let $P_n=(V\left(P_n\right),E\left(P_n\right);f,g)=v_1,v_2,\dots ,v_n$ be the weighted path tree, with vertex set $V\left(P_n\right)=\{v_1,v_2,\dots ,v_n\}$, edge set $E\left(P_n\right)=\{e_1,e_2,\dots ,e_{n-1}\}$, and $f\left(v\right)=y(v\in V\left(P_n\right))$, $g\left(e\right)=z(e\in E\left(P_n\right))$ [11], with above notations; then, we have

$$\begin{array}{cc}\hfill F(P_n;f,g)& =\sum _{i=1}^n(n-i+1)y^i{z}^{i-1}\hfill \\ \hfill F(P_n;f,g;v_1)& =\sum _{i=1}^n{y}^i{z}^{i-1}\hfill \end{array}$$

(2)

Let $U_n=(V\left(U_n\right),E\left(U_n\right);f,g)$ be the weighted unicyclic graph with n vertices and n edges; its vertex and edge weights are $f\left(v\right)=y(v\in V\left(U_n\right)),g\left(e\right)=z(e\in E\left(U_n\right))$, respectively, and the vertices on the cycle are labeled as $v_i(i=1,2,\dots ,n)$ sequentially. With the definition of SGF and structure analysis, it is easy to obtain the following Lemma.

Lemma 3.

Let $U_n=(V\left(U_n\right),E\left(U_n\right);f,g)$ be the above weighted unicyclic graph, for any vertex $v_i$ and any continuous k edges ${\displaystyle \bigcup _{j=1}^k}(v_{i+j-1},v_{i+j})(k=1,2,\dots ,n)(v_i=v_{n+i})$ [23]; then, we have

$$\begin{array}{cc}\hfill F(U_n;f,g)& =n\sum _{i=1}^n{y}^i{z}^{i-1}\hfill \\ \hfill F(U_n;f,g;v_i)& =\sum _{i=1}^{n}i{y}^i{z}^{i-1}\hfill \\ \hfill F(U_n;f,g;\bigcup _{j=1}^k(v_{i+j-1},v_{i+j}))& =\sum _{i=1}^{n-k}i{y}^{i+k}{z}^{i+k-1}\hfill \end{array}$$

(3)

Lemma 4.

Let $G=\left(V\right(G),E(G);f,g)$ denote a weighted graph, $(u,v)\in E\left(G\right)$; let $G/e=\left(V\right(G/e),$$E(G/e);f_e,g_e)$ be the graph that contract v along e to u, with $V(G/e)=V\left(G\right)\backslash v$, $E(G/e)=E\left(G\right)\backslash e$ [28]. Then, the vertex weight is

$$\begin{array}{c}\hfill f_e\left(w\right)=\left\{\begin{array}{cc}f\left(u\right)f\left(v\right)g\left(e\right)\hfill & \mathit{if}w=u,\hfill \\ f\left(w\right)\hfill & \mathit{otherwise}.\hfill \end{array}\right.\end{array}$$

(4)

and we have

$$F(G;f,g)=F(G\backslash e;f,g)+F(G/e;f_e,g_e;u)$$

(5)

Lemma 5.

For a weighted graph $G=\left(V\right(G),E(G);f,g)$ having vertex set $V\left(G\right)=V\left(G_1\right)\cup V\left(G_2\right)$ and edge set $E\left(G\right)=E\left(G_1\right)\cup E\left(G_2\right)$, where $G_1\cap G_2=(u,v)$, the vertex and edge generating functions are $f\left(v\right)=y(v\in V(G\left)\right),g\left(e\right)=z(e\in E(G\left)\right)$, respectively [27]; then, we have

$$F(G;f,g)=\frac{F(G_1;f,g;(u,v))F(G_2;f,g;(u,v))}{y^{2}z}+F(G\backslash (u,v);f,g)$$

(6)

With Lemmas 3 and 5 and a structure analysis, we have the following Theorem immediately.

Theorem 1.

Let $FF{l}_{n,m}=(V\left(FF{l}_{n,m}\right),E\left(FF{l}_{n,m}\right);f,g)$ be the weighted fan flower graph as in Figure 1; $P_n$ be the path connecting $c_1$ and $c_n$ of $FF{l}_{n,m}$; and $FF{l}_{n,m}/P_n$ be the graph contracting $c_n$ along $P_n$ to $c_1$, with the notations given in Table 1; then, for $n\ge 2$, we have

$$\begin{array}{cc}\hfill F_{n,n}^{c_0}& =F(FF{l}_{n,m};f,g;\{c_0,P_n\})=F(FF{l}_{n,m}/P_n;f,g;\{c_0,c_1\})\hfill \\ \hfill & =n{y}^{n-1}{z}^{n-1}\left\{\frac{{(y^m{z}^{m-1}{\displaystyle \sum _{i=1}^{m-1}}i{y}^{i-1}{z}^{i-1})}^{n-1}}{{(y^m{z}^{m-1})}^{n-2}}+\frac{{(y^{2}z{\displaystyle \sum _{i=1}^{m-1}}i{y}^{i-1}{z}^{i-1})}^n}{{\left(y^{2}z\right)}^{n-1}}\right\}\hfill \end{array}$$

(7)

For $n\ge 1$, denote by $FF{l}_{n,m}^{i+1,n}$ the weighted component that contains $c_{i+1}$ of $FF{l}_{n,m}$$\backslash \{{\displaystyle \bigcup _{j=1}^i}(c_0,c_j)\cup (c_0,u_{j,m-2})\cup (c_i,c_{i+1})\}(i=1,2,\dots ,n-1)$. It is easy to know that $F(FF{l}_{n,m}^{i+1,n}$ and $f,g;c_0)=F(FF{l}_{n-i,m};f,g;c_0)$; then, we have the following:

Theorem 2.

Let $FF{l}_{n,m}=(V\left(FF{l}_{n,m}\right),E\left(FF{l}_{n,m}\right);f,g)$ be the weighted fan flower graph, with the notations given in Table 1; for $n\ge 1$, we have

$$\begin{array}{c}\hfill F_n^{c_0}=\left\{\begin{array}{cc}{\displaystyle \sum _{i=1}^m}i{y}^i{z}^{i-1}\hfill & \mathit{if}n=1,\hfill \\ \frac{F_1^{c_0}{F}_{n-1}^{c_0}+{\displaystyle \sum _{i=2}^{n-1}}{F}_{n-i}^{c_0}{F}_{i,i}^{c_0}}{y}+F_{n,n}^{c_0}\hfill & \mathit{otherwise}.\hfill \end{array}\right.\end{array}$$

(8)

where $F_{j,j}^{c_0}(j=2,\dots ,n)$, as given in Theorem 2.

Proof. 

When $n=1$, $FF{l}_{1,m}$ is a unicyclic graph with m vertices, by Lemma 3, we have

$$F_n^{c_0}=\sum _{i=1}^{m}i{y}^i{z}^{i-1}$$

(9)

When $n>1$, we divide the subtree set $S(FF{l}_{n,m},c_0)$ into three cases

$$S(FF{l}_{n,m};c_0)=\bigcup _{i=1}^3{\tau }_i$$

• ${\tau }_1$: not containing $(c_1,c_2)$;
• ${\tau }_2$: contains ${\displaystyle \bigcup _{i=1}^j}(c_i,c_{i+1})$ but not $(c_{j+1},c_{j+2})(j=1,\dots ,n-2)$;
• ${\tau }_3$: contains ${\displaystyle \bigcup _{i=1}^{n-1}}(c_i,c_{i+1})$, namely, the path $P_n$ connecting $c_1$ and $c_n$ of $FF{l}_{n,m}$.

For ${\tau }_1$, by Lemma 5, we can obtain its SGF as

$$\frac{F_1^{c_0}{F}_{n-1}^{c_0}}{y}$$

(10)

Similarly, the SGF of ${\tau }_2$ is

$$\sum _{i=2}^{n-1}\frac{F_{n-i}^{c_0}{F}_{i,i}^{c_0}}{y}$$

(11)

and SGF of ${\tau }_3$ is

$$F_{n,n}^{c_0}$$

(12)

Combining Equations (9)–(12), we can obtain Equation (8); the theorem is thus proved. □

Lemma 6.

Let $FF{l}_{n,m}=(V\left(FF{l}_{n,m}\right),E\left(FF{l}_{n,m}\right);f,g)$ be the weighted fan flower graph and let $P_i(2\le i\le n)$ be the path connecting $c_1$ with $c_i$ of $FF{l}_{n,m}$, with notations given in Table 1; then, we have

$$F_{n,i}^{c_0}=\frac{{\displaystyle \sum _{j=i}^n}{F}_{j,j}^{c_0}{F}_{n-j}^{c_0}}{y}$$

(13)

Proof. 

Firstly, we divide the subtree set of $FF{l}_{n,m}$ containing $P_i(2\le i\le n)$ into three cases:

(i) Not containing $(c_i,c_{i+1})$;

(ii) Contains ${\displaystyle \bigcup _{j=0}^k}(c_{i+j},c_{i+j+1})(k=0,1,2,\dots ,n-i-2)$ but not $(c_{i+j+1},c_{i+j+2})$;

(iii) Contains $P_n$.

For case (i), using a structure analysis, and Lemmas 1 and 2, we obtain the SGF of case (i) as

$$\frac{F_{i,i}^{c_0}{F}_{n-i}^{c_0}}{y}$$

(14)

and the SGF of case (ii) as

$$\sum _{k=0}^{n-i-2}\frac{F_{i+k+1,i+k+1}^{c_0}{F}_{n-(i+k+1)}^{c_0}}{y}$$

(15)

For case (iii), by using Theorem 1, we obtain its SGF as

$$\frac{F_{n,n}^{c_0}{F}_0^{c_0}}{y}$$

(16)

Combining Equations (14)–(16), we can obtain Equation (13); the theorem thus holds. □

3. The Subtree Number of Flower Network

Theorem 3.

Let $F{l}_{n,m}(n\ge 3,m\ge 2)$ be the weighted flower network (see Figure 2); with the notations given in Table 1, we have the SGF of $F{l}_{n,m}(n\ge 3)$ as

$$\begin{array}{cc}\hfill F(F{l}_{n,m};f,g)=& n(\sum _{i=1}^{m-2}(m-1-i)y^i{z}^{i-1}+\sum _{i=1}^n{(\sum _{i=1}^{m-1}{y}^i{z}^{i-1})}^i{z}^{i-1})\hfill \\ \hfill & +\sum _{j=1}^{n-1}\frac{{\displaystyle \sum _{s=j+1}^n}{F}_{s,s}^{c_0}{F}_{n-s}^{c_0}}{y}+\frac{F_1^{c_0}{F}_{n-1}^{c_0}+{\displaystyle \sum _{i=2}^{n-1}}{F}_{n-i}^{c_0}{F}_{i,i}^{c_0}}{y}+F_{n,n}^{c_0}\hfill \end{array}$$

(17)

where $F_{j,j}^{c_0}(j=2,\dots ,n)$ and $F_i^{c_0}(i=1,2,\dots ,n-1)$ are as given in Theorems 1 and 2, respectively.

Proof. 

We characterize the subtrees of $F{l}_{n,m}(n\ge 3,m\ge 2)$ into two cases:

(1) Not containing $c_0$;

(2) Contains $c_0$.

For case (1), it is easy to know that $F{l}_{n,m}\backslash \left\{c_0\right\}$ is a unicyclic graph; with Lemma 1 and Lemma 3, we can obtain its SGF as

$$n(\sum _{i=1}^{m-2}(m-1-i)y^i{z}^{i-1}+\sum _{i=1}^n{(\sum _{i=1}^{m-1}{y}^i{z}^{i-1})}^i{z}^{i-1})$$

(18)

We further divide case (2) into two cases:

• ${\tau }_{2,1}$: not containing $(c_1,c_2)$;
• ${\tau }_{2,2}$: contains ${\displaystyle \bigcup _{k=1}^j}(c_k,c_{k+1})$ but not $(c_{j+1},c_{j+2})(c_{n+1}=c_1)(j=1,2,\dots ,n-1)$.

For ${\tau }_{2,1}$, with the structure analysis and Theorem 2, we have its SGF as

$$F_n^{c_0}$$

(19)

For ${\tau }_{2,2}$, using the structure analysis and Lemma 6, we can obtain its SGF as

$$\begin{array}{cc}\hfill & F(F{l}_{n,m}\backslash (c_{j+1},c_{j+2});f,g;\{c_0,\bigcup _{k=1}^j(c_k,c_{k+1})\})\hfill \\ \hfill & =\sum _{j=1}^{n-1}F(FF{l}_{n,m};f,g;\{c_0,P_{j+1}\})\hfill \\ \hfill & =\sum _{j=1}^{n-1}{F}_{n,j+1}^{c_0}=\sum _{j=1}^{n-1}\frac{{\displaystyle \sum _{s=j+1}^n}{F}_{s,s}^{c_0}{F}_{n-s}^{c_0}}{y}\hfill \end{array}$$

(20)

Combining Equations (18)–(20), we can obtain Equation (17); the theorem thus holds. □

4. The Subtree Number of Sunflower Network

Let $S{f}_{n,m}=(V\left(S{f}_{n,m}\right),E\left(S{f}_{n,m}\right);f,g)(n\ge 3,m\ge 2)$ denote the weighted sunflower network; before solving the problem of enumerating subtrees of sunflower network, we introduce some Lemmas.

Let $U_n=(V\left(U_n\right),E\left(U_n\right);f,g)$ be a weighted graph, and $P_{v_i{v}_j}=v_i\dots v_j$ be the path connecting $v_i$ and $v_j$ of $U_n$; we define $U_n^c=(V\left(U_n^c\right),E\left(U_n^c\right). Let{f}^c,g^c)$ be the weighted graph that contracts $P_{v_i{v}_j}=v_i\dots v_j$ to $v_i$, $V\left(U_n^c\right)=\left\{v_i\right\}\cup \{V\left(U_n\right)\backslash V\left(P_{v_i{v}_j}\right),E\left(U_n^c\right)=E\left(U_n\right)\backslash E\left(P_{v_i{v}_j}\right)$, where

$$f^c\left(v_i\right)=\prod _{v\in V\left(P_{v_i{v}_j}\right)}f\left(v\right)\prod _{e\in E\left(P_{v_i{v}_j}\right)}g\left(e\right)$$

$f^c\left(v\right)=f\left(v\right)$ for $v\in V\left(U_n^c\right)\backslash v_i$ and $g^c\left(e\right)=g\left(e\right)$ for $e\in E\left(U_n^c\right)$.

Lemma 7.

Assume that $U_n$ and $U_n^c$, the weighted unicyclic graphs, are defined as above and $P_{v_i{v}_j}=v_i\dots v_j$ is the path connecting $v_i$ and $v_j$ of $U_n$ [23]; then,

$$F(U_n;f,g;P_{v_i{v}_j})=F(U_n^c;f^c,g^c;v_i)$$

(21)

Let

$$P_1=v_i{v}_{(i+1)\left(modn\right)}\dots v_{(j-1)\left(modn\right)}{v}_j$$

and

$$P_2=v_i{v}_{(i-1)\left(modn\right)}\dots v_{(j+1)\left(modn\right)}{v}_j$$

be the two paths connecting $v_i$ and $v_j$ of $U_n$; moreover, define the weighted unicyclic graph $U_n^{c_1}=(V\left(U_n^{c_1}\right),$$E\left(U_n^{c_1}\right);$$f_1^c,g_1^c)$ as the graph contracting the path $P_1$ of $U_n$ to $v_i$ and $U_n^{c_2}=(V\left(U_n^{c_2}\right),E\left(U_n^{c_2}\right);f_2^c,g_2^c)$ be the graph contracting the path $P_2$ of $U_n$ to $v_i$.

Lemma 8.

Assume that $U_n$, $U_n^{c_1},U_n^{c_2}$ are the unicyclic graphs defined as above and $v_i$ and $v_j$ are two distinct vertices of $U_n$ [23]; then,

$$F(U_n;f,g;v_i,v_j)=F(U_n^{c_1};f_1^c,g_1^c;v_i)+F(U_n^{c_2};f_2^c,g_2^c;v_i)$$

(22)

Before proving the SGF of sunflower network, we first introduce and solve the subtree number enumeration problems of an auxiliary cyclic chain network that is defined as follows.

Definition 4.

Let $a,b$ be positive integers and $a+b=n$, the cyclic chain network $G_t(a,b)=(V\left(G_t(a,b)\right),$$E\left(G_t(a,b)\right);$$f,g\left)\right(t\ge 1)$, be constructed as follows:

• For $t=1$, $G_1$ is an unicyclic graph with length n;
• For $t\ge 2$, let $U_t$ be an unicyclic graph with length t, the vertex set be $V\left(U_t\right)=\{v_1,v_2,\dots ,v_t\}$, and $G_t$ be derived from $U_t$ by replacing each existing edge $(v_i,v_{i+1})$ in $U_t$ by two parallel paths of length a and b (see Figure 4).

Lemma 9.

Let $G_t(t\ge 1)=(V\left(G_t\right),E\left(G_t\right);f,g)$ (see Figure 4) be the weighted auxiliary cyclic chain network defined above; then,

$$F(G_1;f,g)=n\sum _{i=1}^n{y}^i{z}^{i-1}$$

(23)

and

$$\begin{array}{cc}\hfill F(G_t;f,g)=& t(\sum _{i=1}^{a-1}(a-i)y^i{z}^{i-1}+\sum _{j=1}^{b-1}(b-j)y^j{z}^{j-1}+\alpha {\beta }^2\lambda +{\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}{y}^{-s}{\gamma }^{s-1}+\hfill \\ \hfill & y^{1-t}{\gamma }^{t-1}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}{z}^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\hfill \\ \hfill & \sum _{i=1}^{a-p}(1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})y^{p+q+i}{z}^{p+q+i-1}\left)\right)\hfill \end{array}$$

(24)

for $t>1$, where $\alpha ={\displaystyle \sum _{i=1}^a}{y}^i{z}^{i-1}$, $\beta =1+{\displaystyle \sum _{j=1}^{b-1}}{y}^j{z}^j$, $\gamma =y^{a+1}{z}^a{\displaystyle \sum _{j=1}^b}j{y}^{j-1}{z}^{j-1}+y^{b+1}{z}^b{\displaystyle \sum _{i=1}^a}i{y}^i{z}^{i-1}$, $\lambda =1+z{\displaystyle \sum _{i=1}^{a-1}}{y}^i{z}^{i-1}$.

Proof. 

For the case of $t=1$, with Lemma 3, we have

$$F(G_1;f,g)=n\sum _{i=1}^n{y}^i{z}^{i-1}$$

(25)

When $t>1$, we divide the subtrees of $G_t$ into four cases:

(1) Not containing any vertex of $\{v_1,v_2,\dots ,v_t\}$;

(2) Contains only one vertex of $\{v_1,v_2,\dots ,v_t\}$;

(3) Contains only consecutive $s(s=2,3,\dots ,t-1)$ vertices in $\{v_1,v_2,\dots ,v_t\}$;

(4) Contains all vertices of $\{v_1,v_2,\dots ,v_t\}$.

For the sake of brevity, we claim that $\alpha ,\beta ,\lambda ,\gamma$ are notations given in Lemma 9.

For case (1), by observing the structure pattern with Lemma 2, we can the SGF of case (1) as

$$t\left(\sum _{i=1}^{a-1}(a-i)y^i{z}^{i-1}+\sum _{j=1}^{b-1}(b-j)y^j{z}^{j-1}\right)$$

(26)

Moreover, by observing the structure patterns with Lemma 1, we can obtain the SGF of case (2) as

$$t\left(\alpha {\beta }^2\lambda \right)$$

(27)

With Lemmas 1, 5, 7, and 8, we can obtain the SGF of case (3) as

$$\begin{array}{c}\hfill t\left({\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}{y}^{-s}{\gamma }^{s-1}\right)\end{array}$$

(28)

For case (4), let $P_1=\left(v_1\right)u_1{u}_2\dots u_a{u}_{a+1}\left(v_n\right),P_2=\left(v_1\right)w_1{w}_2\dots w_b{w}_{b+1}\left(v_n\right)$ be the two paths connecting $v_1$ and $v_n$ of graph $G_t\backslash v_2$, where $v_1=u_1=w_1,v_n=u_{a+1}=w_{b+1}$.

• ${\tau }_1$: not containing $(u_1,u_2)$ and $(w_1,w_2)$;
• ${\tau }_2$: contains ${\displaystyle \bigcup _{i=1}^p}(u_i,u_{i+1})$ but not $(w_1,w_2)$ and $(u_p,u_{p+1})(p=1,2,\dots ,a-1)$;
• ${\tau }_3$: contains ${\displaystyle \bigcup _{i=1}^j}(w_i,w_{i+1})$ but not $(u_1,u_2)$ and $(w_j,w_{j+1})(j=1,2,\dots ,b-1)$;
• ${\tau }_4$: contains ${\displaystyle \bigcup _{i=1}^p}{\displaystyle \bigcup _{i=1}^j}(u_i,u_{i+1})\cup (w_i,w_{i+1})$ but not $(u_p,u_{p+1})\cup (w_j,w_{j+1})(p=1,2,\dots$, $a-1\left)\right(j=1,2,\dots ,$$b-1)$.

For ${\tau }_1$, with Lemmas 1, 5, 7, and 8, we have the SGF of ${\tau }_1$ as

$$\begin{array}{c}\hfill y^{1-t}{\gamma }^{t-1}\left(\alpha \beta \right)\end{array}$$

(29)

Similarly, the SGF of ${\tau }_2$ is

$$\begin{array}{c}\hfill y^{1-t}{\gamma }^{t-1}(\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}{z}^{p+i-1})\end{array}$$

(30)

Similarly, the SGF of ${\tau }_3$ is

$$\begin{array}{c}\hfill y^{1-t}{\gamma }^{t-1}(\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1})\end{array}$$

(31)

The SGF of ${\tau }_4$ is

$$\begin{array}{c}\hfill y^{1-t}{\gamma }^{t-1}\left(\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\sum _{i=1}^{a-p}(1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})y^{p+q+i}{z}^{p+q+i-1}\right)\end{array}$$

(32)

With structure analysis and Equations (29)–(32), we can obtain the SGF of case (4) as

$$\begin{array}{cc}\hfill & t{\gamma }^{t-1}{y}^{1-t}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}{z}^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\sum _{i=1}^{a-p}\hfill \\ \hfill & (1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})y^{p+q+i}{z}^{p+q+i-1})\hfill \end{array}$$

(33)

With Equations (26)–(28) and (33), we can obtain the SGF of $G_t(t>1)$ as

$$\begin{array}{cc}\hfill F(G_t;f,g)=& t(\sum _{i=1}^{a-1}(a-i)y^i{z}^{i-1}+\sum _{j=1}^{b-1}(b-j)y^j{z}^{j-1}+\alpha {\beta }^2\lambda +{\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}{y}^{-s}{\gamma }^{s-1}+\hfill \\ \hfill & y^{1-t}{\gamma }^{t-1}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}{z}^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\hfill \\ \hfill & \sum _{i=1}^{a-p}(1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})y^{p+q+i}{z}^{p+q+i-1}\left)\right)\hfill \end{array}$$

(34)

□

Lemma 10.

Let $G_t(t\ge 1)=(V\left(G_t\right),E\left(G_t\right);f,g)$ (see Figure 4) be the weighted auxiliary cyclic chain network defined above; then,

• for $t=1$,

  $$F(G_1;f,g;v_k)=\sum _{i=1}^{n}i{y}^i{z}^{i-1}$$

  (35)

  where $v_k\in \{v_1,v_2\}$;
• for $t\ge 2$,

  $$\begin{array}{cc}\hfill F(G_t;f,g;v_k)=& \alpha {\beta }^2\lambda +{\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}s{y}^{-s}{\gamma }^{s-1}+t{y}^{1-t}{\gamma }^{t-1}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}\hfill \\ & z^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\sum _{i=1}^{a-p}(1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})\hfill \\ \hfill & y^{p+q+i}{z}^{p+q+i-1})\hfill \end{array}$$

  (36)

  where $v_k\in \{v_1,v_2,\dots ,v_t\}$, $\alpha ={\displaystyle \sum _{i=1}^a}{y}^i{z}^{i-1}$, $\beta =1+{\displaystyle \sum _{j=1}^{b-1}}{y}^j{z}^j$, $\gamma =y^{a+1}{z}^a{\displaystyle \sum _{j=1}^b}j{y}^{j-1}{z}^{j-1}+y^{b+1}{z}^b{\displaystyle \sum _{i=1}^a}i{y}^i{z}^{i-1}$, $\lambda =1+{\displaystyle \sum _{i=1}^{a-1}}{y}^i{z}^i$.

Proof. 

For $t=1$, $v_k\in \{v_1,v_2\}$, with Lemma 3, we can obtain the SGF of $G_1$ containing $v_k$ as

$$F(G_1;f,g;v_k)=\sum _{i=1}^{n}i{y}^i{z}^{i-1}$$

(37)

For $t>1$, we divide the subtrees of $G_t$ containing $v_k\in \{v_1,v_2,\dots ,v_t\}$ into three cases:

(1) Containing only $v_k$;

(2) Containing only consecutive $i(=2,3,\dots ,t-1)$ vertices in $\{v_1,v_2,\dots ,v_t\}$ including $v_k$;

(3) Containing all vertices in $\{v_1,v_2,\dots ,v_t\}$.

For the sake of brevity, we claim that $\alpha ,\beta ,\lambda ,\gamma$ are the notations given in Lemma 10.

For case (1), with structure analysis and Lemma 1, we can obtain its SGF as

$$\alpha {\beta }^2\lambda$$

(38)

With a structure analysis and Lemmas 1, 5, 7, and 8, we obtain the SGF of case (2) as

$$\begin{array}{c}\hfill {\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}s{y}^{-s}{\gamma }^{s-1}\end{array}$$

(39)

For case (3), with a similar analysis of case (3) in Lemma 9, we have its SGF as

$$\begin{array}{cc}\hfill & t{\gamma }^{t-1}{y}^{1-t}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}{z}^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\sum _{i=1}^{a-p}\hfill \\ \hfill & (1+z\sum _{j=1}^{b-q-1}{y}^j{z}^{j-1})y^{p+q+i}{z}^{p+q+i-1})\hfill \end{array}$$

(40)

Combining Equations (38)–(40), we can obtain the SGF of $G_t$ containing $v_k\in \{v_1,v_2,\dots ,v_t\}$ as

$$\begin{array}{cc}\hfill F(G_t;f,g;v_k)=& \alpha {\beta }^2\lambda +{\left(\alpha \beta \right)}^2\sum _{s=2}^{t-1}s{y}^{-s}{\gamma }^{s-1}+t{y}^{1-t}{\gamma }^{t-1}(\alpha \beta +\beta \sum _{p=1}^{a-1}\sum _{i=1}^{a-p}{y}^{p+i}\hfill \\ \hfill & z^{p+i-1}+\lambda \sum _{q=1}^{b-1}\sum _{j=1}^{b-q}{y}^{q+j}{z}^{q+j-1}+\sum _{p=1}^{a-1}\sum _{q=1}^{b-1}\sum _{i=1}^{a-p}(1+\sum _{j=1}^{b-q-1}{y}^j{z}^j)\hfill \\ \hfill & y^{p+q+i}{z}^{p+q+i-1})\hfill \end{array}$$

(41)

The theorem thus follows. □

Next, we solve the subtree enumeration problem of sunflower network.

Theorem 4.

Let $S{f}_{n,m}=(V\left(S{f}_{n,m}\right),E\left(S{f}_{n,m}\right);f,g)(n\ge 3,m\ge 2)$ be the weighted sunflower network; then, we have its SGF as

$$\begin{array}{cc}\hfill F(S{f}_{n,m};f,g)=& n(\sum _{j=1}^{m-2}(m-j-1)y^j{z}^{j-1}+y{\zeta }_1^2+\sum _{s=2}^{n-1}\left(y^{1-s}{\zeta }_1^2{\zeta }_2^{s-1}\right)+y^{1-n}{\zeta }_2^{n-1}\hfill \\ \hfill & (y{\zeta }_1+\sum _{q=1}^{m-2}\sum _{j=1}^{m-q-1}{y}^{q+j}{z}^{q+j-1}))+y+nyz(y{\zeta }_1^2+\sum _{s=1}^{n-2}(s+1)\left(y^{-s}{\zeta }_1^2{\zeta }_2^s\right)\hfill \\ \hfill & +n{y}^{1-n}{\zeta }_2^{n-1}(y{\zeta }_1+\sum _{q=1}^{m-2}\sum _{j=1}^{m-q-1}{y}^{q+j}{z}^{q+j-1}))+\frac{{({\displaystyle \sum _{i=1}^{m-1}}i{y}^i{z}^{i-1})}^n}{{\left(y^3{z}^2\right)}^{n-1}}+\hfill \\ \hfill & \sum _{j=1}^{n-2}\frac{{\displaystyle \sum _{d_1=1}^{n-1}}{\displaystyle \sum _{d_2=1}^{n-d_1-1}}\dots {\displaystyle \sum _{d_j=1}^{n-{\displaystyle \sum _{k=1}^{j-1}}{d}_k-1}}(n-{\displaystyle \sum _{s=1}^j}{d}_s)\prod _{s=1}^j\varphi \left(d_s\right)\varphi (n-{\displaystyle \sum _{p=1}^j}{d}_p)}{{\left(y^3{z}^2\right)}^j}\hfill \end{array}$$

(42)

where ${\zeta }_1=1+{\displaystyle \sum _{j=1}^{m-2}}{y}^j{z}^j$, ${\zeta }_2={\displaystyle \sum _{j=1}^{m-1}}j{y}^{j+1}{z}^j+y^m{z}^{m-1}$,

$$\begin{array}{c}\hfill \varphi \left(k\right)=\left\{\begin{array}{cc}{\displaystyle \sum _{i=1}^{m-1}}i{y}^i{z}^{i-1}\hfill & \mathit{if}k=1,\hfill \\ y{\zeta }_1^2+{\displaystyle \sum _{s=1}^{k-2}}(s+1)\left(y^{-s}{\zeta }_1^2{\zeta }_2^s\right)\hfill & \mathit{if}2\le k\le n-1.\hfill \\ +k{y}^{1-k}{\zeta }_2^{k-1}\left(y{\zeta }_1+{\displaystyle \sum _{q=1}^{m-2}}{\displaystyle \sum _{j=1}^{m-q-1}}{y}^{q+j}{z}^{q+j-1}\right)\hfill \end{array}\right.\end{array}$$

(43)

Proof. 

We divide the subtrees of $S{f}_{n,m}(n\ge 3,m\ge 2)$ into two cases:

(a) Not containing $c_0$;

(b) Containing $c_0$.

For the sake of brevity, we declare that ${\zeta }_1,{\zeta }_2,\varphi \left(k\right)(k=1,2,\dots ,n-1)$ are the notations given in Theorem 4.

For case (a), with the structure analysis and Lemma 9, we can obtain its SGF as

$$\begin{array}{cc}\hfill & n(\sum _{j=1}^{m-2}(m-j-1)y^j{z}^{j-1}+y{\zeta }_1^2+\sum _{s=2}^{n-1}\left(y^{1-s}{\zeta }_1^2{\zeta }_2^{s-1}\right)+y^{1-n}{\zeta }_2^{n-1}\hfill \\ \hfill & (y{\zeta }_1+\sum _{q=1}^{m-2}\sum _{j=1}^{m-q-1}{y}^{q+j}{z}^{q+j-1}))\hfill \end{array}$$

(44)

For case (b), we further divide it into two cases:

(i) Not containing any edge of ${\displaystyle \bigcup _{i=1}^n}(c_0,c_i)$;

(ii) Contains at least one edge of ${\displaystyle \bigcup _{i=1}^n}(c_0,c_i)$.

It is easy to obtain that the SGf of case (i) is

$$y$$

(45)

For case (ii), we first consider the case of containing only one edge in ${\displaystyle \bigcup _{i=1}^n}(c_0,c_i)$; with the structure analysis and Lemmas 5, 7, 8, and 10, we can obtain the SGF of this case as

$$\begin{array}{cc}\hfill & nyz\left(y{\zeta }_1^2+\sum _{s=1}^{n-2}(s+1)\left(y^{-s}{\zeta }_1^2{\zeta }_2^s\right)+n{y}^{1-n}{\zeta }_2^{n-1}(y{\zeta }_1+\sum _{q=1}^{m-2}\sum _{j=1}^{m-q-1}{y}^{q+j}{z}^{q+j-1})\right).\hfill \end{array}$$

(46)

With Lemmas 5 and 10, we can obtain the SGF of all n edges in ${\displaystyle \bigcup _{i=1}^n}(c_0,c_i)$ as

$$\frac{{({\displaystyle \sum _{i=1}^{m-1}}i{y}^i{z}^{i-1})}^n}{{\left(y^3{z}^2\right)}^{n-1}}$$

(47)

For the case containing only $s(2\le s\le n-1)$ edges in ${\displaystyle \bigcup _{i=1}^n}(c_0,c_i)$, whether $(c_0,c_1)$ is in the s edges or not, we define $(c_0,c_1)$ as the boundary; then, we label the s edges with $e_1,e_2,\dots ,e_s(2\le s\le n-1)$ in a counterclockwise manner. Relabeling the vertex on the cycle adjacent to $e_i$ as $\widetilde{c_i}$, we define $d_i$ the counterclockwise distance between the vertices $\widetilde{c_i}$ and $\widetilde{c_{i+1}}$ on the circle.

Let $\varphi \left(k\right)=F(G_k(1,m-1);f,g;v_j)(2\le k\le n-1)$, where $v_j\in \{v_1,v_2,\dots ,v_k\}$.

Combining Lemmas 3, 5, 7, 8, 10, and the structure analysis, we can obtain the SGF of $S{f}_{n,m}(n\ge 3,m\ge 2)$ containing $s(2\le s\le n-1)$ edges in ${\displaystyle \bigcup _{i=0}^n}(c_0,c_i)$

$$\sum _{j=1}^{n-2}\frac{{\displaystyle \sum _{d_1=1}^{n-1}}{\displaystyle \sum _{d_2=1}^{n-d_1-1}}\dots {\displaystyle \sum _{d_j=1}^{n-{\displaystyle \sum _{k=1}^{j-1}}{d}_k-1}}(n-{\displaystyle \sum _{s=1}^j}{d}_s){\displaystyle \prod _{s=1}^j}\varphi \left(d_s\right)\varphi (n-{\displaystyle \sum _{p=1}^j}{d}_p)}{{\left(y^3{z}^2\right)}^j}$$

(48)

where

$$\begin{array}{c}\hfill \varphi \left(k\right)=\left\{\begin{array}{cc}{\displaystyle \sum _{i=1}^{m-1}}i{y}^i{z}^{i-1}\hfill & \mathrm{if}k=1,\hfill \\ y{\zeta }_1^2+{\displaystyle \sum _{s=1}^{k-2}}(s+1)\left(y^{-s}{\zeta }_1^2{\zeta }_2^s\right)\hfill & \mathrm{if}2\le k\le n-1.\hfill \\ +k{y}^{1-k}{\zeta }_2^{k-1}(y{\zeta }_1+{\displaystyle \sum _{q=1}^{m-2}}{\displaystyle \sum _{j=1}^{m-q-1}}{y}^{q+j}{z}^{q+j-1}).\hfill \end{array}\right.\end{array}$$

(49)

With Equations (44)–(47), we can obtain the Equation (42); the theorem thus holds. □

With the subtree generating functions of flower networks $F{l}_{n,m}(n\ge 3,m\ge 2)$ and sunflower networks $S{f}_{n,m}(n\ge 3,m\ge 2)$, we can easily obtain their exact subtree number indices by taking $y=1$ and $z=1$ into their subtree generating functions.

5. Results and Discussions

It is well known that the subtree number index is closely related to the reliable network design [17,40], and it is an important parameter to measure the reliability of a network for both vertex and edge failures. Namely, networks with more subtrees are more reliable. As an application, in this section, we briefly study the behavior of the subtree number in the flower networks and sunflower networks and discuss the difference of the subtree numbers between flower networks and sunflower networks with some lower-order n and m. From Equation (7) in Theorem 1, Equation (8) in Theorem 2, and Equation (17) in Theorem 3, we can obtain the subtree numbers of flower networks, as shown in

Table 2. The subtree numbers of flower and sunflower networks when $n=12,m=3,4,\dots ,18$.

n	m	$\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)}$	$\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)}$
12	3	808,994,334,366	11.90794548	112,238,363,816,4	12.05014133
12	4	998,610,060,032,920	14.99939594	151,308,674,603,059,0	15.17986383
12	5	265,280,251,112,307,000	17.42370492	404,849,273,581,826,000	17.60729336
12	6	256,550,685,339,735,000,00	19.40917318	384,650,010,292,476,000,00	19.58506575
12	7	122,063,734,917,778,000,000,0	21.08658665	178,548,004,931,270,000,000,0	21.251755
12	8	344,273,389,923,669,000,000,00	22.53690346	490,934,797,202,023,000,000,00	22.69102382
12	9	650,645,762,570,061,000,000,000	23.81334461	905,809,267,379,347,000,000,000	23.95703676
12	10	896,628,634,179,120,000,000,000,0	24.9526126	122,119,065,856,034,000,000,000,00	25.08678347
12	11	957,232,024,063,896,000,000,000,00	25.98101722	127,822,905,177,000,000,000,000,000	26.10660868
12	12	827,993,950,521,421,000,000,000,000	26.91802716	108,623,009,982,456,000,000,000,000,0	27.03592183
12	13	600,392,405,365,584,000,000,000,000,0	27.77843519	775,222,331,646,122,000,000,000,000,0	27.88942627
12	14	374,744,209,248,582,000,000,000,000,00	28.57373493	477,004,278,516,100,000,000,000,000,00	28.67852227
12	15	205,602,572,796,967,000,000,000,000,000	29.31302854	258,359,754,119,165,000,000,000,000,000,0	30.41222486
12	16	100,842,557,399,484,000,000,000,000,000,0	30.00364385	125,251,904,753,382,000,000,000,000,000,0	30.09778434
12	17	448,296,476,198,180,000,000,000,000,000,0	30.65156533	550,957,046,116,700,000,000,000,000,000,0	30.74111774
12	18	182,701,553,239,954,000,000,000,000,000,00	31.26174224	222,390,527,574,997,000,000,000,000,000,00	31.34711629

,

Table 3. The subtree numbers of flower and sunflower networks when $m=12,n=3,4,\dots ,12$.

n	m	$\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)}$	$\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)}$
12	3	569,170,9	6.755,242,688	517,527,0	6.713933012
12	4	980,681,131	8.991527819	990,109,132	8.995683066
12	5	168,515,441,557	11.2266397	181,560,385,458	11.2590211
12	6	291,422,645,379,48	13.4645233	327,929,007,285,78	13.51577983
12	7	506,766,497,010,234,0	15.7048079	589,052,387,641,233,0	15.77015392
12	8	884,180,126,963,189,000	17.94654075	105,597,948,140,887,000,0	18.02365548
12	9	154,536,766,330,510,000,000	20.18903182	189,163,078,432,656,000,000	20.27683637
12	10	270,327,973,135,294,000,000,00	22.43189099	338,765,521,831,683,000,000,00	22.5298992
12	11	473,064,933,203,821,000,000,000,0	24.67492076	606,622,526,889,045,000,000,000,0	24.78291853
12	12	828,000,782,196,875,000,000,000,000	26.91803075	108,623,009,982,456,000,000,000,000,0	27.03592183

and

Table 4. The subtree numbers of flower and sunflower networks when $m=n=3,4,\dots ,12$.

n	m	$\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Sf}}_{\mathit{n},\mathit{m}}\right)}$	$\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)$	${\mathbf{log}}_{10}^{\mathit{\eta }\left({\mathit{Fl}}_{\mathit{n},\mathit{m}}\right)}$
3	3	102,7	3.011570444	101,7	3.007320953
4	4	105,451	5.023050703	112,636	5.051677219
5	5	187,184,91	7.272270835	215,012,25	7.332463204
6	6	513,612,006,6	9.710635168	617,934,704,1	9.790942587
7	7	201,051,445,463,5	12.3033072	249,018,559,016,5	12.39623172
8	8	106,896,683,359,669,0	15.02896423	134,000,723,234,807,0	15.12710714
9	9	725,328,036,700,938,000	17.86053446	928,294,891,665,960,000	17.96768596
10	10	622,370,323,833,015,000,000	20.79404888	804,6744,796,912,410,000,00	20.90562023
11	11	654,629,293,559,492,000,000,000	23.81599544	853,195,489,291,013,000,000,000	23.93104855
12	12	827,993,950,521,421,000,000,000,000	27.03592183	108,623,009,982,456,000,000,000,000,0	27.03592183

; similarly, with Equations (42) and (43) in Theorem 4, we can obtain the subtree numbers of sunflower networks, as shown in Table 2, Table 3 and Table 4.

With Table 2, we can obtain Figure 5; with Table 3, we can obtain Figure 6; and with Table 4, we can obtain Figure 7. Observing Table 2, Table 3 and Table 4 and Figure 5, Figure 6 and Figure 7, we find that the subtree numbers of flower networks are always greater than that of sunflower networks. Therefore, the network reliability of flower networks are higher than that of sunflower networks. When designing a more reliable network, the flower network is a better choice in terms of reliability.

6. Concluding Remarks

Using a generating function, structure analysis, and auxiliary structure introduction, we obtained the subtree generating function of flower networks $F{l}_{n,m}(n\ge 3,m\ge 2)$. Moreover, by introducing and solving the subtrees of an auxiliary cyclic chain network, we presented the subtree generating function of sunflower networks $S{f}_{n,m}(n\ge 3,m\ge 2)$. We also briefly discussed the behavior of the subtree numbers in the flower graphs and sunflower graphs. Additionally, we obtain the conclusion that under some parameter constraints, the flower networks are more reliable than sunflower networks. These findings are likely useful in designing reliable networks. Our study provides a theoretical basis for exploring new structural properties of complex networks and chemical molecules. Many important networks are derived from the flower and sunflower networks; for future work, we intend to investigate other topological indices of flower networks, sunflower networks, and their derived networks and analyze the relationships between them.