Algebraic connectivity of an even uniform hypergraph

被引：118

作者：

Hu, Shenglong ^{[1
]}

Qi, Liqun ^{[1
]}

机构：

[1] Hong Kong Polytech Univ, Dept Appl Math, Kowloon, Hong Kong, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2012年 / 24卷 / 04期

关键词：

Tensor; Hypergraph; Z-eigenvalue; Algebraic connectivity; EIGENVALUES;

D O I：

10.1007/s10878-011-9407-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：564 / 579

页数：16

共 16 条

[1]

[Anonymous], MEM AMS

[2]

[Anonymous], 1973, HYPERGRAPHS COMBINAT

[3] A generalization of the Motzkin-Straus theorem to hypergraphs [J].

Bulo, Samuel Rota ;

Pelillo, Marcello .

OPTIMIZATION LETTERS, 2009, 3 (02) :287-295

[4]

Cartwright D, 2011, LINEAR ALGE IN PRESS

[5]

Chung F., 1992, Spectral Graph Theory

[6]

FIEDLER M, 1973, CZECH MATH J, V23, P298

[7]

Horn R.A., 2012, Matrix Analysis

[8]

Lim L.-H., 2007, THESIS STANDFORD U U

[9]

Lim LH, 2005, IEEE CAMSAP 2005: FIRST INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING, P129

[10]

Lim LH., 2011, JRI WORKSH EIG NONN

← 1 2 →