On the distance spectral radius of digraphs with given diameter

被引：4

作者：

Xi, Weige ^{[1
,3
]}

So, Wasin ^{[2
]}

Wang, Ligong ^{[1
,3
]}

机构：

[1] Northwestern Polytech Univ, Dept Appl Math, Sch Sci, Xian 710072, Shaanxi, Peoples R China

[2] San Jose State Univ, Dept Math & Stat, San Jose, CA 95192 USA

[3] Northwestern Polytech Univ, Xian Budapest Joint Res Ctr Combinator, Xian 710129, Shaanxi, Peoples R China

来源：

LINEAR & MULTILINEAR ALGEBRA | 2021年 / 69卷 / 14期

基金：

中国国家自然科学基金;

关键词：

Strongly connected; distance spectral radius; diameter; SIGNLESS LAPLACIAN; GRAPHS; MATRIX;

D O I：

10.1080/03081087.2019.1682496

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The distance spectral radius of a strongly connected digraph G is the eigenvalue of its distance matrix with the largest modulus. Let denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing among all strongly connected digraphs with order n and diameter d, for d = 1, 2, 3, 4, 5, 6, 7, n-1. We also propose a conjecture about the minimum distance spectral radius among all strongly connected digraphs with given diameter .

引用

页码：2547 / 2557

页数：11

共 50 条

[21] The distance spectral radius of graphs with given independence number
Lin, Huiqiu
Feng, Lihua
ARS COMBINATORIA, 2015, 121 : 113 - 123
[22] ON THE DISTANCE SPECTRAL RADIUS OF TREES WITH GIVEN DEGREE SEQUENCE
Dadedzi, Kenneth
Misanantenaina, Valisoa Razanajatovo
Wagner, Stephan
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (02) : 495 - 524
[23] Distance spectral radius of trees with given number of segments
Lin, Hongying
Zhou, Bo
LINEAR ALGEBRA AND ITS APPLICATIONS, 2020, 600 (600) : 40 - 59
[24] On the Aa-spectral radius of graphs with given size and diameter
Feng, Zhimin
Wei, Wei
LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 650 : 132 - 149
[25] Note on the eccentricity spectral radius of uniform hypertrees with given diameter
Tang, Zikai
Deng, Hanyuan
DISCRETE APPLIED MATHEMATICS, 2024, 358 : 214 - 216
[26] On the Maximum Spectral Radius of (m,n)-trees with Given Diameter
CHENG Wei
Department of Mathematics
数学季刊, 2006, (01) : 129 - 137
[27] Maximum size of digraphs of given radius
Cambie, Stijn
DISCRETE MATHEMATICS, 2023, 346 (08)
[28] The distance spectral radius of digraphs (vol 161, pg 2537, 2013)
Lin, Huiqiu
Shu, Jinlong
DISCRETE APPLIED MATHEMATICS, 2015, 188 : 51 - 52
[29] The (distance) signless Laplacian spectral radii of digraphs with given dichromatic number
Li, Jinxi
You, Lihua
ARS COMBINATORIA, 2017, 132 : 257 - 267
[30] Colorings and spectral radius of digraphs
Drury, Stephen
Lin, Huiqiu
DISCRETE MATHEMATICS, 2016, 339 (01) : 327 - 332

← 1 2 3 4 5 →