论文部分内容阅读
IN this note all graphs are undirected, finite and simple. For a subgraph H of G,ε（H） andμ（H） denote the number of edges in H and the number of cycles in H respectively. H[X]denotes the subgraph of H induced by X. Given two disjoint subsets X and Y of V（G