Name
Abstract | ||
|---|---|---|
A graph G is said to be fractional k-extendable if every k-matching M can be extended to a fractional perfect matching G(h) with h(e) = 1 for every e is an element of M, where h is the indicator function of G(h). In this note, a sufficient condition for a graph to be fractional k-extendable is obtained. |
Year | Venue | Keywords |
|---|---|---|
2007 | Lecture Notes in Engineering and Computer Science | graph,k-matching,fractional perfect matching,fractional k-extendable |
Field | DocType | Citations |
Graph,Computer science,Theoretical computer science,Artificial intelligence,Machine learning | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiguo Yu | 1 | 688 | 108.74 |
| Na Wang | 2 | 7 | 11.10 |
| Xingjian Feng | 3 | 0 | 0.34 |
| Guizhen Liu | 4 | 175 | 27.36 |