Maximizing spectral radii of uniform hypergraphs with few edges

DOI10.7151/DMGT.1906MaRDI QIDQ339469zbMATH OpenOpenAlexFDO

Authors Yizheng Fan, Ying-Ying Tan, Xi-Xi Peng, An-Hong Liu

Publication date 11 November 2016

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1502.04271

zbMATH Keywords

tensorspectral radiusgirthbicyclic hypergraphunicyclic hypergraph

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Hypergraphs (05C65)

Abstract: In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.

Recommendations

• Spectral radius of uniform hypergraphs
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• Spectral radii of two kinds of uniform hypergraphs
• Spectral radius and matching number of the unicyclic hypergraph

Cites work

• scientific article; zbMATH DE number 3972892 (Why is no real title available?)
• scientific article; zbMATH DE number 3972894 (Why is no real title available?)
• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Degree maximal graphs are Laplacian integral
• Eigenvalues of a real supersymmetric tensor
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Hypergraph theory. An introduction
• Maximal graphs and graphs with maximal spectral radius
• On eigenvalue problems of real symmetric tensors
• On spectral hypergraph theory of the adjacency tensor
• On the maximal index of graphs with a prescribed number of edges
• On the spectral radius of (0,1)-matrices
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Perron-Frobenius theorem for nonnegative tensors
• Some spectral properties of uniform hypergraphs
• Spectra of uniform hypergraphs
• Spektren endlicher Grafen
• The extremal spectral radii of k-uniform supertrees

Cited in

(41)

• The \(H\)-spectra of a class of generalized power hypergraphs
• Bounds on the spectral radius of general hypergraphs in terms of clique number
• Spectral radii of two kinds of uniform hypergraphs
• A bound on the spectral radius of hypergraphs with \(e\) edges
• Signed \(k\)-uniform hypergraphs and tensors
• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• The maximum spectral radius of the weighted bicyclic hypergraphs
• Inverse Perron values and connectivity of a uniform hypergraph
• The maximum spectral radii of uniform supertrees with given degree sequences
• The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
• Spectral radius and matching number of the unicyclic hypergraph
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• On the spectral radius of uniform weighted hypergraph
• Distance spectral radii of k-uniform bicyclic hypergraphs
• The spectral radii of intersecting uniform hypergraphs
• Uniform supertrees with extremal spectral radii
• Uniform hypergraphs with the first two smallest spectral radii
• The weighted hypergraph with the maximum spectral radius
• The linear unicyclic hypergraph with the second or third largest spectral radius
• On the spectral radius of uniform hypertrees
• On spectral theory of a k-uniform directed hypergraph
• Maximum spectral radius of outerplanar 3‐uniform hypergraphs
• The trace of uniform hypergraphs with application to Estrada index
• A homogeneous polynomial associated with general hypergraphs and its applications
• The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• On ABC spectral radius of uniform hypergraphs
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The trace and Estrada index of uniform hypergraphs with cut vertices
• The first two largest spectral radii of uniform supertrees with given diameter
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• The maximum -spectral radius and the majorization theorem of k-uniform supertrees
• Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
• Spectral properties of general hypergraphs
• The maximum spectral radius ofk-uniform hypergraphs withrpendent vertices

This page was built for publication: Maximizing spectral radii of uniform hypergraphs with few edges

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