L. Kang

activity

20142023

most citedOn the principal eigenvectors of uniform hypergraphs

20 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs

Erfang Shan, Yuxiao Sun, Liying Kang

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $H (G)$ , of a…

math.CO2014

Extremal problems for the p-spectral radius of graphs

Liying Kang, Vladimir Nikiforov

The $p$ -spectral radius of a graph $G$ of order $n$ is defined for any real number $p \geq 1$ as \[ λ^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\righ…

math.CO2014★ 3 cited

The p-spectral radius of k-partite and k-chromatic uniform hypergraphs

L. Kang, V. Nikiforov, X Yuan

We characterize the r-graph with maximal p-spectral radius among the k-partite r-graphs of order n, and the 3-graph with maximal p-spectral radius among the k-chromatic 3-graphs of…

Coloring clique-hypergraph of K5​-minor-free graphs

Extremal problems for the p-spectral radius of graphs

The p-spectral radius of k-partite and k-chromatic uniform hypergraphs

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs