【摘要】 本文利用文[3]的方法给出了两类满足A(H)=3的图,从而肯定了满足A(H)=3的图是不唯一的。本文还给出了满足A(H)=3的最小图。更多还原

【Abstract】 In this paper we construct two infinite classes of graphs with A(H)=3. Thus we answer the question whether the graph with A(H)=3 is unique. And we construct the smallest graph with A(H)=3.更多还原