The Maximum Number of Short Paths in a Bipartite Outerplanar Graph
Let f(An,H)(f(Hn,H))denote the maximum number of copies of H in an n-vertex bipartite outerplanar graph(an n-vertex bipartite outerplanar graph containing a Hamilton cycle).Let F(An,H)(F(Hn,H))denote the set of all n-vertex bipartite outerplanar graphs(all n-vertex bipartite outerplanar containing Hamilton cycle)with f(An,H)(f(Hn,H))copies of H.Then f(An,P2)and F(An,P2)for all n≥5 are determined,f(Hn,P3)and F(Hn,P3)for all n ≥ 4 are also determined.
NETL
NSTL
万方数据
