On the Laplacian spectral radius of a graph

By Huiqing Liu, Mei Lu, F. Tian. 2004

59 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/85ba01be63dd10e3bad50515ae95fe82133b2437

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Xiaodong Zhang

In Geometry and Topology

1. Xiaodong Zhang
2. A. Yu
3. Vladimir Nikiforov
4. Zoran Stanic

In Organic Chemistry

1. A. Yu
2. Xiaodong Zhang

Citations in the corpus

• The Laplacian eigenvalues of graphs: a survey (2011, background): “14 ([57], [61]) Let G be a simple connected graph with n vertices and m edges.”
• On the spectral radius of graphs (2004, background): “Up to now, many bounds for ρ(G) and μ(G) were given (see, for instance, [1–12]), but most of them are upper bounds.”