Lingsheng Shi

activity

20112018

collaborators

3 papers

math.CO2018

Complete minors and stability numbers

Wenkai Fu, Lingsheng Shi

Hadwiger's conjecture implies that $n \leq α h$ for all graphs of order $n$ , stability number $α$ , and Hadwiger number $h$ . Combining ideas of Kawarabayashi et al. and Wood, we prove t…

math.SP2014

Graphs of order $n$ and diameter $2 (n - 1) /3$ minimizing the spectral radius

Jingfen Lan, Lingsheng Shi

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ ver…

math.CO2011

Graphs with Diameter $n - e$ Minimizing the Spectral Radius

Jingfen Lan, Linyuan Lu, Lingsheng Shi

The spectral radius $ρ (G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A (G)$ . For a fixed integer $e \geq 1$ , let $G_{n, n - e}^{min}$ be a graph with minimal spec…

Complete minors and stability numbers

Graphs of order n and diameter 2(n−1)/3 minimizing the spectral radius

Graphs with Diameter n−e Minimizing the Spectral Radius

Graphs of order $n$ and diameter $2 (n - 1) /3$ minimizing the spectral radius

Graphs with Diameter $n - e$ Minimizing the Spectral Radius