Maximizing spectral radii of uniform hypergraphs with few edges

From MaRDI portal
Publication:339469

DOI10.7151/dmgt.1906zbMath1350.05111arXiv1502.04271OpenAlexW2219534318MaRDI QIDQ339469

Xi-Xi Peng, Yi-Zheng Fan, Ying-Ying Tan, An-Hong Liu

Publication date: 11 November 2016

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

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




Related Items (37)

The \(H\)-spectra of a class of generalized power hypergraphsThe first few unicyclic and bicyclic hypergraphs with largest spectral radiiDistance spectral radii of k-uniform bicyclic hypergraphsThe minimum spectral radius of the r-uniform supertree having two vertices of maximum degreeInverse Perron values and connectivity of a uniform hypergraph\((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applicationsSpectral properties of general hypergraphsThe weighted hypergraph with the maximum spectral radiusThe maximum spectral radii of uniform supertrees with given degree sequencesThe effect on the spectral radius of \(r\)-graphs by grafting or contracting edgesA homogeneous polynomial associated with general hypergraphs and its applicationsThe linear unicyclic hypergraph with the second or third largest spectral radiusThe spectral radii of intersecting uniform hypergraphsThe first two largest spectral radii of uniform supertrees with given diameterThe maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameterThe trace and Estrada index of uniform hypergraphs with cut verticesThe effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edgeThe maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertreesOn the spectral radius of uniform weighted hypergraphOn spectral theory of a k-uniform directed hypergraphThe maximum spectral radius of uniform hypergraphs with given number of pendant edgesThe maximum spectral radius ofk-uniform hypergraphs withrpendent verticesBounds on the spectral radius of general hypergraphs in terms of clique numberSpectral radius and matching number of the unicyclic hypergraphSharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique numberThe stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphsA bound on the spectral radius of hypergraphs with \(e\) edgesSigned \(k\)-uniform hypergraphs and tensorsThe smallest spectral radius of bicyclic uniform hypergraphs with a given sizeOn the spectral radius of uniform hypertreesUniform supertrees with extremal spectral radiiOn the \(\alpha \)-spectral radius of uniform hypergraphsUniform hypergraphs with the first two smallest spectral radiiExtremality of graph entropy based on degrees of uniform hypergraphs with few edgesLeast H-eigenvalue of adjacency tensor of hypergraphs with cut verticesOn the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radiiSpectral radii of two kinds of uniform hypergraphs



Cites Work


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