Inverse Perron values and connectivity of a uniform hypergraph

MaRDI QIDQ1627203zbMATH OpenFDO

Authors Changjiang Bu, Haifeng Li, Jiang Zhou

Publication date 22 November 2018

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.09655, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p28

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

connectivityhypergraphLaplacian tensorinverse Perron value

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Hypergraphs (05C65)

Abstract: In this paper, we show that a uniform hypergraph $mathcalG$ is connected if and only if one of its inverse Perron values is larger than $0$. We give some bounds on the bipartition width, isoperimetric number and eccentricities of $mathcalG$ in terms of inverse Perron values. By using the inverse Perron values, we give an estimation of the edge connectivity of a $2$-design, and determine the explicit edge connectivity of a symmetric design. Moreover, relations between the inverse Perron values and resistance distance of a connected graph are presented.

Recommendations

• Analytic connectivity of \(k\)-uniform hypergraphs
• The geometry connectivity of hypergraphs
• scientific article; zbMATH DE number 3857159
• The Laplacian of a uniform hypergraph
• Inverse degree and edge-connectivity

Cites work

• scientific article; zbMATH DE number 4193718 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Analytic connectivity of \(k\)-uniform hypergraphs
• Characteristic vertices of weighted trees via perron values
• Combinatorial Perron values of trees and bottleneck matrices
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• E-cospectral hypergraphs and some hypergraphs determined by their spectra
• Eigenvalues of a real supersymmetric tensor
• Hypergraph theory. An introduction
• Laplacian eigenvalues and partition problems in hypergraphs
• Maximizing spectral radii of uniform hypergraphs with few edges
• Minimizing Effective Resistance of a Graph
• On resistance-distance and Kirchhoff index
• On spectral hypergraph theory of the adjacency tensor
• On the Kirchhoff and the Wiener indices of graphs and block decomposition
• On the resistance matrix of a graph
• Resistance characterizations of equiarboreal graphs
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
• Some results on resistance distances and resistance matrices
• Some spectral properties of uniform hypergraphs
• Spectra of uniform hypergraphs
• The Laplacian tensor of a multi-hypergraph
• The \(H\)-spectra of a class of generalized power hypergraphs
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• The curl of a weighted network
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• The extremal spectral radii of k-uniform supertrees
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
• \(M\)-tensors and some applications

Cited in

(4)

• Analytic connectivity of \(k\)-uniform hypergraphs
• Hypergraph characterizations of copositive tensors
• Signed \(k\)-uniform hypergraphs and tensors
• The geometry connectivity of hypergraphs

This page was built for publication: Inverse Perron values and connectivity of a uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1627203)