双圈图补图的距离谱半径

李远菁; 李丹; 刘康

doi:10.13568/j.cnki.651094.651316.2022.05.19.0003

您当前的位置：

首页 >

文章列表页 >

双圈图补图的距离谱半径

数理科学 | 更新时间：2026-01-21

- 双圈图补图的距离谱半径
- 双圈图补图的距离谱半径
- 新疆大学学报（自然科学版中英文） 2023年40卷第2期页码：184-190
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  国家自然科学基金“关于图的距离矩阵的相关特征值的研究”（11901498）
- DOI：10.13568/j.cnki.651094.651316.2022.05.19.0003
  中图分类号： O157.5
- 纸质出版：2023
- 稿件说明：
移动端阅览
[1]李远菁,李丹,刘康.双圈图补图的距离谱半径[J].新疆大学学报(自然科学版)(中英文),2023,40(02):184-190+221.
[1]李远菁,李丹,刘康.双圈图补图的距离谱半径[J].新疆大学学报(自然科学版)(中英文),2023,40(02):184-190+221. DOI： 10.13568/j.cnki.651094.651316.2022.05.19.0003.

DOI：10.13568/j.cnki.651094.651316.2022.05.19.0003.

摘要

设图G是一个简单连通图，点vi和vj之间最短路径的长度称为点vi和vj在图G中的距离，记作dG(vi

vj).图G的距离矩阵为D(G)=(dG(vi

vj))n×n.距离矩阵D(G)特征值的模的最大值称为图G的距离谱半径.在n阶双圈图补图中刻画了距离谱半径最大的极图.

Abstract

Let G be a simple connected graph.The distance between vertices vi and vj in the graph G

denoted by d G(vi

vj)

is the length of the shortest path from vi to vj

and D(G)=(dG(vi

vj))n×n is the distance matrix of G.The distance spectral radius of G is defined as the maximum module of eigenvalues of distance matrix D(G).We characterize the extremal graph among the complements of bicyclic graphs with n-order which maximizes the distance spectral radius.

关键词

Keywords

references

INDULAL G. Sharp bounds on the distance spectral radius and the distance energy of graphs[J]. Linear Algebra and its Applications, 2009, 430(1):106-113.

ILIC A. Distance spectral radius of trees with given matching number[J]. Discrete Applied Mathematics, 2010, 158(16):1799-1806.

BOSE S S, NATH M, PAUL S. Distance spectral radius of graphs withrpendent vertices[J]. Linear Algebra and its Applications,2011, 435(11):2828-2836.

LIN H Q, HONG Y, WANG J F, et al. On the distance spectrum of graphs[J]. Linear Algebra and its Applications, 2013, 439(6):1662-1669.

ZHANG X L. On the distance spectral radius of unicyclic graphs with perfect matchings[J]. Electronic Journal of Linear Algebra,2014, 27:569-587.

LIN H Q, DRURY S. The distance spectrum of complements of trees[J]. Linear Algebra and its Applications, 2017, 530:185-201.

QIN R, LI D, CHEN Y Y, et al. The distance eigenvalues of the complements of unicyclic graphs[J]. Linear Algebra and its Applications, 2020, 598:49-67.

PILLAI S U, SUEL T, CHA S H. The Perron-Frobenius theorem:some of its applications[J]. IEEE Signal Processing Magazine,2005, 22(2):62-75.

HORN R A, JOHNSON C R. Matrix analysis[M]. Cambridge:Cambridge University Press, 1985.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

具有强互反性的双圈图的刻画(英文)

乘法型兰州指标关于树，单圈图和双圈图的极值（英文）

具有n-4个悬挂点的双圈补图的最小特征值的下界