摘要
通过对图进行收缩、夺邻、嫁接等运算,并利用Perron向量的一些性质,给出最大度为Δ(Δ≥3)的n(n≥5)阶极大邻接谱双圈图的一些性质,同时得到极大邻接谱双圈图的一些必要条件.
By using the operations of contracting, moving neighbors, grafting and the properties of Perron vector, the prop- erties of the order n (n≥5) maximal-adjacency-spectrum bicyclic graphs with the maximum degree A (△≥3) are studied, and some necessary conditions about it are also obtained.
出处
《天津师范大学学报(自然科学版)》
CAS
2015年第4期16-19,共4页
Journal of Tianjin Normal University:Natural Science Edition
基金
华侨大学科研基金资助项目(10HZR26)
关键词
极大邻接谱双圈图
邻接谱
最大度
双圈图
maximal-adjacency-spectrum bicyclic graphs
adjacency-spectrum
maximum degree
bicyclic graphs