A Characterization of Graphs by Codes from their Incidence Matrices

Electronic Journal Of Combinatorics

Peter Dankelmann¹ 

关键词: Codes;    Graphs;    Edge-connectivity;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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$

【 授权许可】

Others