两类双圈图最大特征值的比较
Comparison of the Maximum Eigenvalues of Two Types of Bicyclic Graphs
DOI: 10.12677/AAM.2021.102045, PDF,   
作者: 秦旭艳, 李玉瑛, 郝艺方：太原理工大学数学学院，山西 晋中
关键词: 双圈图；特征值；Bicyclic Graph； Eigenvalue
摘要: 本文研究了两类连通双圈图的最大特征值，得出了随着n的增大，双圈图Sn(3,3)和θn(3,3)的最大特征值也随之增大；同时给出了n≥5在的条件下，Sn(3,3)和θn(3,3)的最大特征值的比较。
Abstract: This paper studies the maximum eigenvalues of two types of connected bicyclic graphs, and finds that as n increases, the maximum eigenvalues of bicyclic graphs Sn(3,3) and θn(3,3) also increase; at the same time, it also gives a comparison of the maximum eigenvalues of Sn(3,3) and θn(3,3) under the condition of n≥5.
文章引用：秦旭艳, 李玉瑛, 郝艺方. 两类双圈图最大特征值的比较[J]. 应用数学进展, 2021, 10(2): 396-401. https://doi.org/10.12677/AAM.2021.102045

参考文献

[1] Brualdi, R.A. and Solheid, E.S. (1986) On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones. SIAM Journal on Algebraic and Discrete Methods, 7, 265-272. [Google Scholar] [CrossRef] 
[2] Yu, A.M. and Tian, F. (2004) On the Spectral Radius of Bicyclic Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 88, 91-101.
[3] Liu, Y.L. and Liu, B.L. (2010) The Spectral Radius of Bicyclic Graphs with Prescribed Degree Sequences. Linear Algebraic and Its Applications, 433, 1015-1023. [Google Scholar] [CrossRef] 
[4] Bapat, R.B. (2010) Graphs and Matrices. Springer, London. [Google Scholar] [CrossRef] 
[5] 刘木伙, 柳柏濂. 利用计算机计算n阶图的特征多项式的方法[J]. 高等学校计算数学学报, 2012, 34(3): 260-266.

为你推荐