On the Spectral Radius of Graphs with $k$-Vertex Cut

Wang, Guoping; Huang, Qiongxiang; Cai, Jing

Abstract

References

Ars Combinatoria

Volume 089
Pages: 431-435

Research article

On the Spectral Radius of Graphs with $k$ -Vertex Cut

^¹,², ^³, ^¹

¹Department of Mathematics, Xinjiang Normal University, Urumai, Xinjiang 830000, P.R.China

²Department of Mathematics, Jiangsu Teachers University of Technology, Changzhou, Jiangsu 213001, P.R.China

³The College of Mathematics and Systems Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P.R.China

Published: 31/10/2008

Download PDF
Cite

Copyright Link
License

Abstract

We study the spectral radius of graphs with $n$ vertices and a $k$ -vertex cut and describe the graph which has the maximal spectral radius in this class. We also discuss the limit point of the maximal spectral radius.

Contents

Ars Combinatoria

On the Spectral Radius of Graphs with $k$ -Vertex Cut

Abstract

Information

Guidelines

CP Initiatives

Follow CP

Contents

Ars Combinatoria

On the Spectral Radius of Graphs with k-Vertex Cut

Abstract

Information

Guidelines

CP Initiatives

Follow CP

On the Spectral Radius of Graphs with $k$ -Vertex Cut