首页> 外文期刊>Journal of Combinatorial Optimization >Algebraic connectivity of an even uniform hypergraph
【24h】

Algebraic connectivity of an even uniform hypergraph

机译:均匀一致的超图的代数连通性

获取原文
获取原文并翻译 | 示例
           

摘要

We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform hypergraphs and set some foundations for the spectral hypergraph theory based upon Laplacian tensors. Especially, algebraic connectivity of an even uniform hypergraph based on Z-eigenvalues of the corresponding Laplacian tensor is introduced and its connections with edge connectivity and vertex connectivity are discussed.
机译:我们将图的拉普拉斯矩阵推广到甚至均匀超图的拉普拉斯张量,并为基于拉普拉斯张量的频谱超图理论奠定了基础。特别地,介绍了基于相应拉普拉斯张量的Z-特征值的均匀均匀超图的代数连通性,并讨论了其与边缘连通性和顶点连通性的连接。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号