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