Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number

In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii of hypergraphs with fixed number of vertices an...

書目詳細資料
Main Authors:	Qiannan Niu, Haizhen Ren, Lei Zhang
格式:	Article
語言:	English
出版:	Hindawi Limited 2021-01-01
叢編:	Discrete Dynamics in Nature and Society
在線閱讀:	http://dx.doi.org/10.1155/2021/5805239

相似書籍

On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
由: Lei Zhang, et al.
出版: (2022-01-01)

Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges
由: Fan Yi-Zheng, et al.
出版: (2016-11-01)

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs
由: Chuang Lv, et al.
出版: (2020-02-01)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
由: Alexandre Bazin, et al.
出版: (2023-04-01)

On the α-Spectral Radius of Uniform Hypergraphs
由: Guo Haiyan, et al.
出版: (2020-05-01)

Covering the Edges of a Random Hypergraph by Cliques
由: Rödl Vojtěch, et al.
出版: (2022-11-01)

Distance signless Laplacian eigenvalues, diameter, and clique number
由: Saleem Khan, et al.
出版: (2022-04-01)

On vertex independence number of uniform hypergraphs
由: Chishti Tariq A., et al.
出版: (2014-06-01)

Bounds on the Clique and the Independence Number for Certain Classes of Graphs
由: Valentin E. Brimkov, et al.
出版: (2024-01-01)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
由: Boix-Adserà, Enric, et al.
出版: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
由: Boix-Adsera, Enric, et al.
出版: (2021)

A general result on the spectral radii of nonnegative k-uniform tensors
由: Chuang Lv, et al.
出版: (2020-02-01)

Bounds for graph energy in terms of vertex covering and clique numbers
由: Hilal A. Ganie, et al.
出版: (2019-10-01)

On $\alpha$-spectral theory of a directed k-uniform hypergraph
由: Gholam-Hasan Shirdel, et al.
出版: (2020-09-01)

Lower bounds on the signed (total) $k$-domination number depending on the clique number
由: L‎. ‎Volkmann
出版: (2018-01-01)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
由: Gottlob, G, et al.
出版: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
由: Gottlob, G, et al.
出版: (2004)

The Smallest Spectral Radius of Graphs with a Given Clique Number
由: Jing-Ming Zhang, et al.
出版: (2014-01-01)

A Measure for the Vulnerability of Uniform Hypergraph Networks: Scattering Number
由: Ning Zhao, et al.
出版: (2024-02-01)

k-clique partition of complete k-uniform hypergraphs(完全k一致超图的k团分划)
由: HUANGQing-xue(黄庆学)
出版: (2005-07-01)

Random cliques in random graphs and sharp thresholds for F-factors
由: Riordan, O
出版: (2022)

Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number
由: Supachoke Isariyapalakul, et al.
出版: (2022-05-01)

Hypergraphs of bounded disjointness
由: Scott, A, et al.
出版: (2014)

Bounds for the Energy of Hypergraphs
由: Liya Jess Kurian, et al.
出版: (2024-11-01)

Uplifting edges in higher-order networks: Spectral centralities for non-uniform hypergraphs
由: Gonzalo Contreras-Aso, et al.
出版: (2024-11-01)

Sombor index of uniform hypergraphs
由: Xiuwen Wang, et al.
出版: (2024-10-01)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
由: Goldberg, L, et al.
出版: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
由: Goldberg, L, et al.
出版: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
由: Galanis, A, et al.
出版: (2015)

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
由: Su Li, et al.
出版: (2014-02-01)

On the Laplacian spectral radii of Halin graphs
由: Huicai Jia, et al.
出版: (2017-04-01)

on the number of cliques and cycles in graphs
由: Mojgan Emami, et al.
出版: (2013-06-01)

Upper bounds for packings of spheres of several radii
由: DAVID DE LAAT, et al.
出版: (2014-09-01)

Problems concerning sharp coefficient functionals of bounded turning functions
由: Muhammmad Ghaffar Khan, et al.
出版: (2023-09-01)

Metric uniformization and spectral bounds for graphs
由: Kelner, Jonathan Adam, et al.
出版: (2012)

Improved upper bounds in clique partitioning problem
由: Alexander B. Belyi, et al.
出版: (2019-11-01)

General sharp upper bounds on the total coalition number
由: János Barát, et al.
出版: (2024-01-01)

Some Sharp Bounds on the Negative Decision Number of Graphs
由: Liang Hongyu
出版: (2013-09-01)

Sharp Upper Bounds on the Clar Number of Fullerene Graphs
由: Gao Yang, et al.
出版: (2018-02-01)

Sharp bounds of the number of zeros of Abelian integrals with parameters
由: Xianbo Sun, et al.
出版: (2014-02-01)