二部外可平面图中短路的最大个数
The Maximum Number of Short Paths in a Bipartite Outerplanar Graph
杨柯 1徐常青 1兰永新1
作者信息
- 1. 河北工业大学理学院,天津 300401
- 折叠
摘要
记所有n阶二部外可平面图(包含Hamilton圈的二部外可平面图)中包含H的复制最多的图中H的复制的个数为f(An,H)(f(Hn,H)).记所有包含H的复制的个数为f(An,H)(f(Hn,H))的n阶二部外平面图(包含Hamilton圈的二部外可平面图)的集合为F(An,H)(F(Hn,H)).确定了当n≥ 5时,f(An,P2)的值及所有极图以及当n≥4时,f(Hn,P3)的值及所有极图.
Abstract
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.
关键词
二部外可平面图/Hamilton圈/路Key words
bipartite outerplanar graph/Hamilton cycle/path引用本文复制引用
出版年
2024
NETL
NSTL
万方数据