Algebraic connectivity of an even uniform hypergraph
From MaRDI portal
Publication:1928511
DOI10.1007/S10878-011-9407-1zbMath1261.05072OpenAlexW2095180325MaRDI QIDQ1928511
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9407-1
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)
Related Items (79)
Nonsingular \(H\)-tensor and its criteria ⋮ Circulant tensors with applications to spectral hypergraph theory and stochastic process ⋮ A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Some improved Ky Fan type eigenvalue inclusion sets for tensors ⋮ Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors ⋮ Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs ⋮ Extension of Moore–Penrose inverse of tensor via Einstein product ⋮ The E-eigenvectors of tensors ⋮ Some new inclusion sets for eigenvalues of tensors with application ⋮ A survey on the spectral theory of nonnegative tensors ⋮ On the largest eigenvalue of a symmetric nonnegative tensor ⋮ The dominant eigenvalue of an essentially nonnegative tensor ⋮ The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory ⋮ On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph ⋮ Computing all Laplacian H-eigenvalues for a uniform loose path of length three ⋮ The spectrum of a class of uniform hypergraphs ⋮ The Laplacian tensor of a multi-hypergraph ⋮ Necessary and sufficient conditions for copositive tensors ⋮ Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming ⋮ On the estimates of the \(\mathcal{Z}\)-eigenpair for an irreducible nonnegative tensor ⋮ Some variational principles for \(Z\)-eigenvalues of nonnegative tensors ⋮ E-cospectral hypergraphs and some hypergraphs determined by their spectra ⋮ Even order uniform hypergraph via the Einstein product ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ Tensor logarithmic norm and its applications ⋮ Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ Spectra of uniform hypergraphs ⋮ On some spectral radius inequalities for the Hadamard product of nonnegative tensors ⋮ \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors ⋮ The location of H-eigenvalues of real even order symmetry tensors ⋮ On Best Low Rank Approximation of Positive Definite Tensors ⋮ A DCA-Newton method for quartic minimization over the sphere ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ On the iterative criterion for strong \(\mathcal{H}\)-tensors ⋮ On spectral theory of a k-uniform directed hypergraph ⋮ H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph ⋮ On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs ⋮ Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues ⋮ The solution methods for the largest eigenvalue (singular value) of nonnegative tensors and convergence analysis ⋮ Bounds for the greatest eigenvalue of positive tensors ⋮ A MODIFIED FR CONJUGATE GRADIENT METHOD FOR COMPUTING -EIGENPAIRS OF SYMMETRIC TENSORS ⋮ Analytic connectivity of k-uniform hypergraphs ⋮ The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph ⋮ Properties and methods for finding the best rank-one approximation to higher-order tensors ⋮ Double \(B\)-tensors and quasi-double \(B\)-tensors ⋮ The Drazin inverse of an even-order tensor and its application to singular tensor equations ⋮ The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph ⋮ On the uniqueness of the positive Z-eigenvector for nonnegative tensors ⋮ Some criteria for identifying strong \(\mathcal{H}\)-tensors ⋮ \(MB\)-tensors and \(MB_0\)-tensors ⋮ Finding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length Three ⋮ An even order symmetric \(B\) tensor is positive definite ⋮ Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths ⋮ The Laplacian of a uniform hypergraph ⋮ Computing hypermatrix spectra with the Poisson product formula ⋮ Primitive tensors and directed hypergraphs ⋮ The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs ⋮ Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product ⋮ Further results on \(B\)-tensors with application to location of real eigenvalues ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ Tensor \(Z\)-eigenvalue complementarity problems ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Perron vector analysis for irreducible nonnegative tensors and its applications ⋮ Numerical study on Moore-Penrose inverse of tensors via Einstein product ⋮ The characteristic polynomial of the complete 3-uniform hypergraph ⋮ An eigenvalue localization set for tensors with applications to determine the positive (semi-)definiteness of tensors ⋮ Spectral directed hypergraph theory via tensors ⋮ An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms ⋮ On spectral hypergraph theory of the adjacency tensor ⋮ Simplifying the computation of the spectrum of the complete \(k\)-uniform hypergraph ⋮ Adjacency spectra of random and complete hypergraphs ⋮ Exceptionally regular tensors and tensor complementarity problems ⋮ Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors ⋮ Generalized Tensor Eigenvalue Problems ⋮ A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map ⋮ Large hypertree width for sparse random hypergraphs ⋮ A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems ⋮ Properties of some classes of structured tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Eigenvalues and invariants of tensors
- The degree of the E-characteristic polynomial of an even order tensor
- New stopping criteria for detecting infeasibility in conic optimization
- Laplacian matrices of graphs: A survey
- The number of eigenvalues of a tensor
- Eigenvalues of a real supersymmetric tensor
- Matrix Analysis
- Sums of even powers of real linear forms
This page was built for publication: Algebraic connectivity of an even uniform hypergraph