Name
Abstract | ||
|---|---|---|
AbstractHighlights •We prove the sharp binding number bound for P ≥ 3-factor uniform graphs.•Our result has potential applications in related network problems.•An open problem on factor uniform graph is proposed. AbstractA graph G is P ≥ k-factor uniform if for arbitrary e 1 , e 2 ∈ E ( G ) with e 1 ≠ e 2, G admits a P ≥ k-factor including e 1 and excluding e 2. Recently, Zhou and Sun [12] proved that a 2-edge-connected graph G is a P ≥ 3-factor uniform graph if b i n d ( G ) > 9 4. However, the maximum known binding number of a 2-edge-connected graph that is not P ≥ 3-factor uniform is 5/3. In this paper, we prove that b i n d ( G ) > 5 3 is exactly the tight binding number bound for P ≥ 3-factor uniform graphs. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ipl.2021.106162 | Periodicals |
Keywords | DocType | Volume |
Graph, Path factor, Binding number, P->= k-factor uniform graph, Combinatorial problems | Journal | 172 |
Issue | ISSN | Citations |
C | 0020-0190 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Gao | 1 | 160 | 45.78 |
| Weifan Wang | 2 | 868 | 89.92 |