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）...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 cycles of G. In this paper, some forbidden induced subgraphs axe given for r（G） = n - 3 and all graphs with r（G） = j3（G） = n - 3 are characterized展开更多
基金Supported by FRG, Hong Kong Baptist-University the first author is supported by National Natural Science Foundation of China （Grant No. 10671061） The authors would like to thank the anonymous referee for a number of helpful suggestions.
文摘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 cycles of G. In this paper, some forbidden induced subgraphs axe given for r（G） = n - 3 and all graphs with r（G） = j3（G） = n - 3 are characterized
