In this paper, we prove the following results: let G be a graph with even order P ≥ 2k + 2, if t(G) 〉 k, then the subgraph of G obtained by deleting any 2k-edges or 2k-vertices has a fractional perfect matching.
文摘In this paper, we prove the following results: let G be a graph with even order P ≥ 2k + 2, if t(G) 〉 k, then the subgraph of G obtained by deleting any 2k-edges or 2k-vertices has a fractional perfect matching.