用户登录
期刊信息
  • 主管单位:
  • 上海市教育委员会
  • 主办单位:
  • 上海理工大学
  • 主  编:
  • 庄松林
  • 地  址:
  • 上海市军工路516号
  • 邮政编码:
  • 200093
  • 联系电话:
  • 021-55277251
  • 电子邮件:
  • xbzrb@usst.edu.cn
  • 国际标准刊号:
  • 1007-6735
  • 国内统一刊号:
  • 31-1739/T
  • 邮发代号:
  • 4-401
  • 单  价:
  • 15.00
  • 定  价:
  • 90.00
曾建宇,何常香.一类图的谱[J].上海理工大学学报,2019,41(5):417-421.
一类图的谱
Spectra of a Class of Graphs
投稿时间:2018-06-05  
DOI:10.13255/j.cnki.jusst.2019.05.002
中文关键词:    商矩阵  极图
英文关键词:spectra  quotient matrix  extremal graph
基金项目:国家自然科学基金资助项目(11301340)
作者单位E-mail
曾建宇 上海理工大学 理学院, 上海 200093  
何常香 上海理工大学 理学院, 上海 200093 changxiang-he@163.com 
摘要点击次数: 134
全文下载次数: 189
中文摘要:
      Kmm阶完全图,将n+1个m阶完全图通过固定的方式连结,得到(mn+m)阶完全关联图Hn,Km。在利用商矩阵及秩的相关结论后,给出了完全关联图Hn,Km的邻接矩阵、拉普拉斯矩阵和无符号拉普拉斯矩阵的特征值,从而确定了完全关联图Hn,Km的邻接谱、拉普拉斯谱和无符号拉普拉斯谱。同时,基于对Brualdi-Solheid谱半径问题的研究,并将这类谱半径问题推广到图的拉普拉斯谱半径和无符号拉普拉斯谱半径的研究中,给出了Hn,Km(所有点数为N的完全关联图构成的集合,其中N = m(n + 1))中邻接谱半径的上界,拉普拉斯谱和无符号拉普拉斯谱半径的上、下界;并刻画了Hn,Km中邻接谱半径达到上界的极图,以及拉普拉斯谱和无符号拉普拉斯谱半径达到上、下界时的极图。
英文摘要:
      Let Km is a complete graph of order m. By linking n+1 complete graphs of order m in a fixed way, a complete associated graph Hn,Km of order (mn + m) was obtained. The adjacency eigenvalues, Laplacian eigenvalues and signless Laplacian eigenvalues of Hn,Km were provided according to the relevant conclusions about quotient matrix and rank. So the adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum of Hn,Km were determined. At the same time, based on the study of Brualdi-Solheid spectral radius, the research of this kind of spectral radius problem was extended to the study of Laplacian spectral radius and signless Laplacian spectral radius of graphs. The upper and lower bounds of the radius of adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum of Hn,Km (the set of complete correlated graphs with points N where N=m(n + 1)) were provided. And the extremal graphs were described where the radius of adjacency spectrum attained the upper bound and Laplacian spectrum and signless Laplacian spectrum attained the upper or lower bounds.
HTML   查看全文  查看/发表评论  下载PDF阅读器