A Characterization of Graphs by Codes from their Incidence Matrices

[摘要] We continue our earlier investigation of properties of linear codes generated by the rows of incidence matrices of $k$-regular connected graphs on $n$ vertices. The notion of edge connectivity is used to show that, for a wide range of such graphs, the $p$

[学科分类] 离散数学和组合数学

[关键词] Codes;Graphs;Edge-connectivity