泛圈图边数下界研究

Study on The Lower Bound of The Number of Edges of Pancyclic Graphs

研究证明了任意n(≥3)阶图G,当边数m≥n^(2)-3n+6/2时,G是泛圈图,且n^(2)-3n+6/2是边数下界.

It is proved that for any order n(>=3)of a graph G,when the number of edges is m≥n^(2)-3n+6/2,G is a pancyclic graph,and the lower bound of the number of edges of the pancyclic graph is n^(2)-3n+6/2.