本刊英文版Vol.27(2011),No.9论文摘要(英文)

<正>Graphs Whose Critical Groups Have Larger Rank Yao Ping HOU Wai Chee SHIU Wai Hong CHAN Abstract The critical group C(G) of a graph G is a refinement of the number of spanning trees of the graph and is closely connected with the Laplacian matrix.Let r(G) be the minimum number of generators(i.e.,the rank) of the group C(G) andβ(G) be the number of independent