Shiying Wang
Abstract
This text proved that given any g(x),if is bipartite(mg+1,m)f-graph,M is any matching with m edges of G,then there is exists a(g,f)-factor F which contains any edge of M,but not contain other m-1 edges.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This text proved that given any g(x),if is bipartite(mg+1,m)f-graph,M is any matching with m edges of G,then there is exists a(g,f)-factor F which contains any edge of M,but not contain other m-1 edges.
Key concepts: Combinatorics, Bipartite graph, Mathematics, Graph, Matching (statistics), Enhanced Data Rates for GSM Evolution, Factorization, Discrete mathematics