The maximum spectral radius of the weighted bicyclic hypergraphs
Let \(G = (V (G),E(G),W(G))\) be a weighted hypergraph, where \(V (G)\) is the vertex set, \(E(G) = \{e_1,e_2,\ldots,e_m\}\) the edge set with \(e_i\subset V(G)\) for \(i = 1,\dots ,m\) and \(W(G) = \{w_G(e) \in\mathbb{R}\mid e \in E(G)\}\) the set of weights of \(G\). Then \(e_i\) with \(1\leq i\leq m\) is called an edge of \(G\). If \(|e_i|=k\) for \(1\leq i\leq m\), then \(G\) is called a weighted \(k\)-uniform hypergraph.\N\NLet \(\mathbb{B}_{n,k,a}\) be the set of the connected weighted \(k\)-uniform bicyclic hypergraphs on \(n\) vertices with positive integer weights and fixed total weight sum \(a\), where \(k\geq 4\) and \(a\geq \frac{n+1}{k-1}\geq 3\). The main result characterizes hypergraphs in \(\mathbb{B}_{n,k,a}\) with maximum spectral radius. The spectral radius of \(G\) is the spectral radius of the adjacency tensor of \(G\).
- The weighted hypergraph with the maximum spectral radius
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- Maximizing spectral radii of uniform hypergraphs with few edges
- The smallest spectral radius of bicyclic uniform hypergraphs with a given size
- The spectral radius of maximum weighted unicyclic graph.
- A general product of tensors with applications
- Connected hypergraphs with small spectral radius
- Eigenvalues of a real supersymmetric tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Maximizing spectral radii of uniform hypergraphs with few edges
- On spectral hypergraph theory of the adjacency tensor
- On the spectral radius of uniform hypertrees
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Spectral radii of two kinds of uniform hypergraphs
- Spectral radius of r-uniform supertrees with perfect matchings
- Spectral theory of weighted hypergraphs via tensors
- Symmetric nonnegative tensors and copositive tensors
- The extremal spectral radii of k-uniform supertrees
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- The maximum spectral radii of uniform supertrees with given degree sequences
- The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
- The smallest spectral radius of bicyclic uniform hypergraphs with a given size
- The weighted hypergraph with the maximum spectral radius
This page was built for publication: The maximum spectral radius of the weighted bicyclic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586414)
