Ying-Ying Tan

activity

20132021

most citedMaximizing spectral radii of uniform hypergraphs with few edges

60 citations · 110 across the 10 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015★ 10 cited

The largest $H$ -eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs

Yi-Zheng Fan, Murad-ul-Islam Khan, Ying-Ying Tan

Let $G$ be a simple graph or hypergraph, and let $A (G), L (G), Q (G)$ be the adjacency, Laplacian and signless Laplacian tensors of $G$ respectively. The largest $H$ -eigenvalues (resp.…

math.CO2015★ 21 cited

The $H$ -spectrum of a generalized power hypergraph

Murad-ul-Islam Khan, Yi-Zheng Fan

The generalized power of a simple graph $G$ , denoted by $G^{k, s}$ , is obtained from $G$ by blowing up each vertex into an $s$ -set and each edge into a $k$ -set, where $1 \le s \le \…

math.CO2015★ 60 cited

Maximizing spectral radii of uniform hypergraphs with few edges

Yi-Zheng Fan, Ying-Ying Tan, Xi-Xi Peng +1

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 hyp…

The largest H-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs

The H-spectrum of a generalized power hypergraph

Maximizing spectral radii of uniform hypergraphs with few edges

The largest $H$ -eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs

The $H$ -spectrum of a generalized power hypergraph