Scholarlink

<p>Expanders are highly connected sparse graphs which have a wide range of applications in computer science and mathematics. In this paper, we construct a family of expander graphs using the tensor product of cycle graph with complete graph both of which are non-expanders and prove that a particular case of this family of expanders is a bipartite expander. We also prove the sufficient condition for the tensor product of two regular graphs to be an edge-expander graph. Edge-expanders can be constructed using this result. Finally, we construct an unbalanced biregular bipartite expander using edge-vertex incidence graph. This newly constructed expander can be used as an error correcting code.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Construction of \((n,d,\alpha )\)-expanders with zero spectral gap

  • 期刊论文

  • 发表日期：

    2026年8月4日

查看全文
  • Machasri Manickam,
  • Kalyani Desikan

摘要

Expanders are highly connected sparse graphs which have a wide range of applications in computer science and mathematics. In this paper, we construct a family of expander graphs using the tensor product of cycle graph with complete graph both of which are non-expanders and prove that a particular case of this family of expanders is a bipartite expander. We also prove the sufficient condition for the tensor product of two regular graphs to be an edge-expander graph. Edge-expanders can be constructed using this result. Finally, we construct an unbalanced biregular bipartite expander using edge-vertex incidence graph. This newly constructed expander can be used as an error correcting code.