双圈图的补图的谱半径
The Spectral Radius of the Complement of Bicyclic Graphs
DOI: 10.12677/PM.2023.136175, PDF,    科研立项经费支持
作者: 邱 欢, 王 岚, 王国平*：新疆师范大学数学科学学院，新疆 乌鲁木齐
关键词: 邻接矩阵；谱半径；补图；Adjacency Matrix； Spectral Radius； Complement Graphs
摘要: 设θn*是将n−4条悬挂边粘到θ(2,1,2)的一个三度点得到的双圈图。本文我们证明了n个点的双圈图的补图的最大谱半径只在θn*取到。
Abstract: Let θn* be the bicyclic graph obtained by attaching n−4 pendant edges to a vertex of degree 3 on θ(2,1,2). In this paper we show that the maximum spectral radiu is achieved uniquely by θn* among all complements of bicyclic graphs of order n.
文章引用：邱欢, 王岚, 王国平. 双圈图的补图的谱半径[J]. 理论数学, 2023, 13(6): 1714-1719. https://doi.org/10.12677/PM.2023.136175

参考文献

[1] Cvertković, D., Doob, M. and Sachs, H. (1980) Spectra of Graphs. Academic Press, New York.
[2] Cvertković, D. and Rowlinson, P. (1990) The Largest Eigenvalue of a Graph: A Survey. Linear and Multilinear Algebra, 28, 3-33. [Google Scholar] [CrossRef] 
[3] Hong, Y. (1998) Upper Bounds of the Spectral Radius of Graphs in Terms of Genus. Journal of Combinatorial Theory, Series B, 74, 153-159. [Google Scholar] [CrossRef] 
[4] Chang, A., Tian, F. and Yu, A.M. (2004) On the Index of Bicyclic Graphs with Perfect Matchings. Discrete Mathematics, 283, 51-59. [Google Scholar] [CrossRef] 
[5] Guo, S.G. (2005) The Spectral Radius of Unicyclic and Bicyclic Graphs with n Vertices and k Pendant Vertices. Linear Algebra and Its Applications, 408, 78-85. [Google Scholar] [CrossRef] 
[6] Liu, J. and Zhang, Z. (2010) Spectral Radius of the Complement of Unicyclic Graphs. Journal of East China Normal University (Natural Science), 5, 14-19.
[7] Horn, R.A. and Johnson, C.R. (1986) Matrix Analysis. Cambridge University Press, Cambridge.

为你推荐