Nowhere-zero -flow of graphs with small independence number |
| |
Authors: | Jiaao Li Rong Luo Yi Wang |
| |
Affiliation: | 1. Department of Mathematics, West Virginia University, Morgantown, WV 26506, United States;2. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China;3. School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, China |
| |
Abstract: | Tutte’s -flow conjecture states that every -edge-connected graph admits a nowhere-zero -flow. In this paper, we characterize all graphs with independence number at most that admit a nowhere-zero -flow. The characterization of -flow verifies Tutte’s -flow conjecture for graphs with independence number at most and with order at least . In addition, we prove that every odd--edge-connected graph with independence number at most admits a nowhere-zero -flow. To obtain these results, we introduce a new reduction method to handle odd wheels. |
| |
Keywords: | Integer flows Group connectivity Independence number Odd edge connectivity Modulo orientation Corresponding author at: School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China. |
本文献已被 ScienceDirect 等数据库收录! |
|