论文信息 - Laplacian Eigenvalues and Partition Problems in Hypergraphs

Laplacian Eigenvalues and Partition Problems in Hypergraphs

We use the generalization of the Laplacian matrix to hypergraphs to obtain several spectral-like results on partition problems in hypergraphs which are computationally difficult to solve (NP-hard or NP-complete). Therefore it is very important to obtain nontrivial bounds. More precisely, the following parameters are bounded in the paper: bipartition width, averaged minimal cut, isoperimetric number, max-cut, independence number and domination number.

J. A. Rodŕıguez | J. A. Rodríguez

[1] J. Rodríguez. On the Laplacian Spectrum and Walk-regular Hypergraphs , 2003 .

[2] D. Cvetkovic,et al. Spectra of graphs : theory and application , 1995 .

[3] M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[4] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[5] B. Mohar. Some applications of Laplace eigenvalues of graphs , 1997 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Jin Ho Kwak,et al. Isoperimetric numbers of graph bundles , 1996, Graphs Comb..

[8] J. Rodri´guez. On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs , 2002 .

[9] Nabil Kahale. Isoperimetric Inequalities and Eigenvalues , 1997, SIAM J. Discret. Math..

[10] Bojan Mohar,et al. Laplace eigenvalues of graphs - a survey , 1992, Discret. Math..

[11] Bojan Mohar,et al. Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[12] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[13] B. Mohar,et al. Eigenvalues and the max-cut problem , 1990 .

[14] R. Merris. A survey of graph laplacians , 1995 .

[15] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .