### Abstract

Let G be a simple connected graph of order n with degree sequence d _{1},d_{2},⋯,d_{n} in non-increasing order. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer ℓ at most n, we give a sharp upper bound for ρ(G) by a function of d_{1},d_{2},⋯,d _{ℓ}, which generalizes a series of previous results.

Original language | English |
---|---|

Pages (from-to) | 3511-3515 |

Number of pages | 5 |

Journal | Linear Algebra and Its Applications |

Volume | 438 |

Issue number | 8 |

DOIs | |

State | Published - 29 Jan 2013 |

### Keywords

- Adjacency matrix
- Degree sequence
- Graph
- Spectral radius

## Fingerprint Dive into the research topics of 'Spectral radius and degree sequence of a graph'. Together they form a unique fingerprint.

## Cite this

Liu, C. A., & Weng, C. (2013). Spectral radius and degree sequence of a graph.

*Linear Algebra and Its Applications*,*438*(8), 3511-3515. https://doi.org/10.1016/j.laa.2012.12.016