A Note On Edge Connectivity and Parity Factor

2013/01/31 by Hongliang Lu, Lu, Hongliang
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Software-Defined Networks and 5G #math.CO

paper · pdf · doi:10.48550/arxiv.1301.7565

5 pages

arxiv created 2013/01/31 · openalex publication_date 2013/01/31 · arxiv updated 2013/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we investigate some parity factors by using Lovász's (g,f)-parity theorem. Let m>0 be an integer. Firstly, we obtain a sufficient and necessary condition for some graphs to have a parity factor with restricted minimum degree. Secondly, we obtain some sufficient conditions for a graph to have a parity factor with minimum degree m in term of edge connectivity.

Related

• Note on parity factors of regular graphs
• A characterization for graphs having strong parity factors
• Eigenvalues and parity factors in graphs
• A Degree Condition for a Graph to have (a,b)-Parity Factors
• A Degree Condition for Graphs Having All (a,b)-Parity Factors