scispace - formally typeset
Open AccessJournal ArticleDOI

Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs

TLDR
In this paper, the authors studied the spectral properties of the connected odd-bipartite hypergraphs and showed that the Laplacian H-spectrum and signless H-Spectrum of a connected -uniform hypergraph are equal if and only if the hypergraph is even and is odd.
Abstract
A -uniform hypergraph is called odd-bipartite, if is even and there exists some proper subset of such that each edge of contains odd number of vertices in . Odd-bipartite hypergraphs are generalizations of the ordinary bipartite graphs. We study the spectral properties of the connected odd-bipartite hypergraphs. We prove that the Laplacian H-spectrum and signless Laplacian H-spectrum of a connected -uniform hypergraph are equal if and only if is even and is odd-bipartite. We further give several spectral characterizations of the connected odd-bipartite hypergraphs. We also give a characterization for a connected -uniform hypergraph whose Laplacian spectral radius and signless Laplacian spectral radius are equal; thus, provide an answer to a question raised by L. Qi. By showing that the Cartesian product of two odd-bipartite -uniform hypergraphs is still odd-bipartite, we determine that the Laplacian spectral radius of is the sum of the Laplacian spectral radii of and , when and are both connected odd-bipa...

read more

Citations
More filters
Journal ArticleDOI

The extremal spectral radii of $$k$$k-uniform supertrees

TL;DR: It is proved that for all these three kinds of spectral radii of hypergraphs, the hyperstar of the connected and acyclic supertree attains uniquely the maximum spectral radius among all k-uniform supertrees on n vertices.
Journal ArticleDOI

On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs

TL;DR: In this paper, the adjacency or signless Laplacian spectral radius of a simple graph G is characterized for all non-odd-bipartite hypergraphs G k, k 2 of fixed order.
Posted Content

Some spectral properties of uniform hypergraphs

TL;DR: Some spectral characterizations of odd-bipartite hypergraphs are given, and a partial answer to a question posed by Shao et al (2014) is given.
Journal ArticleDOI

Some spectral properties of uniform hypergraphs

TL;DR: In this article, the Laplacian tensor tensor of a regular hypergraph is derived from the spectrum of the degree sequence of the hypergraph, and the spectral properties of power hypergraphs are studied.
Journal ArticleDOI

The maximum spectral radii of uniform supertrees with given degree sequences

TL;DR: This paper determines the unique k -uniform supertree with the maximum spectral radius among all k - uniform supertrees with a given degree sequence by using 2-switch operation and edge-moving operation on superTrees.
References
More filters
Journal ArticleDOI

Eigenvalues of a real supersymmetric tensor

TL;DR: It is shown that eigenvalues are roots of a one-dimensional polynomial, and when the order of the tensor is even, E-eigenvaluesare roots of another one- dimensional polynomials associated with the symmetric hyperdeterminant.
Proceedings ArticleDOI

Singular values and eigenvalues of tensors: a variational approach

TL;DR: A theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigen values is proposed.
Journal ArticleDOI

Perron-Frobenius theorem for nonnegative tensors

TL;DR: In this paper, the Perron-Frobenius Theorem for nonnegative matrices was generalized to the class of nonnegative tensors, and the authors generalized it to nonnegative matrix classes.
Journal ArticleDOI

Spectra of uniform hypergraphs

TL;DR: In this paper, a spectral theory of uniform hypergraphs is presented, which closely parallels Spectral Graph Theory (SG Theory), and a number of natural analogies of basic results in SG Theory are established.
Journal ArticleDOI

Perron–Frobenius theorem for nonnegative multilinear forms and extensions

TL;DR: In this article, the convergence rate of the power algorithm to the unique normalized eigenvector for polynomial maps with nonnegative coefficients was shown to be linear in the number of coefficients.
Related Papers (5)