The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge

Abstract In this paper, we investigate how the spectral radius (resp., signless Laplacian spectral radius) changes when a connected uniform hypergraph is perturbed by subdividing an edge. We extend the results of Hoffman and Smith from connected graphs to connected uniform hypergraphs. Moreover, we also study how the Laplacian spectral radius behaves when an odd-bipartite uniform hypergraph is perturbed by subdividing an edge. As applications, we determine the unique unicyclic hypergraph with the largest signless Laplacian spectral radius, and also determine the unique unicyclic even uniform hypergraph with the largest Laplacian spectral radius.

[1]  Liying Kang,et al.  Bounds on the spectral radius of uniform hypergraphs , 2019, Discret. Appl. Math..

[2]  Ying-Ying Tan,et al.  Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges , 2016, Discuss. Math. Graph Theory.

[3]  Liqun Qi,et al.  Eigenvalues of a real supersymmetric tensor , 2005, J. Symb. Comput..

[4]  Yong Lu,et al.  The maximum spectral radii of uniform supertrees with given degree sequences , 2017 .

[5]  A. Chang,et al.  The effect on the spectral radius of r-graphs by grafting or contracting edges , 2018, Linear Algebra and its Applications.

[6]  Tan Zhang,et al.  On Spectral Hypergraph Theory of the Adjacency Tensor , 2012, Graphs Comb..

[7]  Lihua Feng,et al.  Minimizing the Laplacian spectral radius of trees with given matching number , 2007 .

[8]  Linyuan Lu,et al.  Connected Hypergraphs with Small Spectral Radius , 2014, 1402.5402.

[9]  S. Gaubert,et al.  Perron–Frobenius theorem for nonnegative multilinear forms and extensions , 2009, 0905.1626.

[10]  Yi-Zheng Fan,et al.  On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs , 2015 .

[11]  Guihai Yu,et al.  The Laplacian spectral radius for unicyclic graphs with given independence number , 2010 .

[12]  L. Qi H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors , 2013, 1303.2186.

[13]  Dragoš Cvetković,et al.  Graph spectra in Computer Science , 2011 .

[14]  Liqun Qi,et al.  The first few unicyclic and bicyclic hypergraphs with larger spectral radii , 2016, 1607.08291.

[15]  D. Cvetkovic,et al.  Towards a spectral theory of graphs based on the signless Laplacian, I , 2009 .

[16]  Honghai Li,et al.  The Matching Polynomials and Spectral Radii of Uniform Supertrees , 2018, Electron. J. Comb..

[17]  Joshua N. Cooper,et al.  Spectra of Uniform Hypergraphs , 2011, 1106.4856.

[18]  Ji-Ming Guo,et al.  The Laplacian spectral radius of a graph under perturbation , 2007, Comput. Math. Appl..

[19]  J. Shao A general product of tensors with applications , 2012, 1212.1535.

[20]  Yanfei Du,et al.  The first two largest spectral radii of uniform supertrees with given diameter , 2018 .

[21]  L. Qi,et al.  The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph , 2013, 1304.1315.

[22]  Liqun Qi,et al.  The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph , 2013, Discret. Appl. Math..

[23]  Honghai Li,et al.  The extremal spectral radii of $$k$$k-uniform supertrees , 2014, J. Comb. Optim..