首页 | 本学科首页   官方微博 | 高级检索  
     

三圈图的无符号拉普拉斯谱半径
引用本文:陈媛媛,王国平. 三圈图的无符号拉普拉斯谱半径[J]. 运筹学学报, 2019, 23(1): 81-89. DOI: 10.15960/j.cnki.issn.1007-6093.2019.01.009
作者姓名:陈媛媛  王国平
作者单位:1. 新疆大学数学与系统科学学院, 乌鲁木齐 830046;2. 新疆师范大学数学科学学院, 乌鲁木齐 830046
基金项目:国家自然科学基金(No.11461071)
摘    要:
假设图G的点集是V(G)={v_1,v_2,…,v_n},用d_(v_i)(G)表示图G中点v_i的度,令A(G)表示G的邻接矩阵,D(G)是对角线上元素等于d_(v_i)(G)的n×n对角矩阵,Q(G)=D(G)+A(G)是G的无符号拉普拉斯矩阵,Q(G)的最大特征值是G的无符号拉普拉斯谱半径.现确定了所有点数为n的三圈图中无符号拉普拉斯谱半径最大的图的结构.

关 键 词:无符号拉普拉斯谱半径  三圈图  
收稿时间:2016-12-26

On the signless Laplacian spectral radius of tricyclic graphs
CHEN Yuanyuan,WANG Guoping. On the signless Laplacian spectral radius of tricyclic graphs[J]. OR Transactions, 2019, 23(1): 81-89. DOI: 10.15960/j.cnki.issn.1007-6093.2019.01.009
Authors:CHEN Yuanyuan  WANG Guoping
Affiliation:1. College of Mathematics and System Science, Xinjiang University, Urumqi 830046, China;2. School of Mathematical Sciences, Xinjiang Normal University, Urumqi 830046, China
Abstract:
Suppose that the vertex set of a graph G is V(G)={v1,v2,…,vn}. Then we denote by dvi(G) the degree of vi in G. Let A(G) be the adjacent matrix of G and D(G) be the n×n diagonal matrix with its (i,i)-entry equal to dvi(G). Then Q(G)=D(G)+A(G) is the signless Laplacian matrix of G. The signless Laplacian spectral radius of G is the largest eigenvalue of Q(G). In this paper we determine the extremal graph with maximum signless Laplacian spectral radius among all tricyclic graphs of order n.
Keywords:signless Laplacian spectral radius  tricyclic graph  
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹学学报》浏览原始摘要信息
点击此处可从《运筹学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号