Jingfen Lan

collaborators

3 papers

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

Diameters of Graphs with Spectral Radius at most $3/2 2$

Jingfen Lan, Linyuan Lu

The spectral radius $ρ (G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix. Woo and Neumaier discovered that a connected graph $G$ with $ρ (G) \leq 3/2 2$ is…

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…

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

Diameters of Graphs with Spectral Radius at most 3/22​

Graphs with Diameter n−e Minimizing the Spectral Radius

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

Diameters of Graphs with Spectral Radius at most $3/2 2$

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