Maximizing spectral radii of uniform hypergraphs with few edges

DOI10.7151/DMGT.1906zbMATH Open1350.05111arXiv1502.04271OpenAlexW2219534318MaRDI QIDQ339469FDOQ339469

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)

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.

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

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

zbMATH Keywords

tensorspectral radiusgirthbicyclic hypergraphunicyclic hypergraph

Mathematics Subject Classification ID

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

Cites Work

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

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
• The maximum spectral radius of the weighted bicyclic hypergraphs
• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• 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
• On the spectral radius of uniform weighted hypergraph
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• 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 spectral theory of a k-uniform directed hypergraph
• Maximum spectral radius of outerplanar 3‐uniform hypergraphs
• On the spectral radius of uniform hypertrees
• The trace of uniform hypergraphs with application to Estrada index
• On ABC spectral radius of uniform hypergraphs
• A homogeneous polynomial associated with general hypergraphs and its applications
• The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• 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 minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• The maximum \(\alpha \)-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)