On the spectral radius of bi-block graphs with given independence number α

被引:11
作者
Das, Joyentanuj [1 ]
Mohanty, Sumit [1 ]
机构
[1] IISER Thiruvananthapuram, Sch Math, Maruthamala PO, Thiruvananthapuram 695551, Kerala, India
关键词
Complete bipartite graphs; Bi-block graphs; Independence number; Spectral radius; TREES;
D O I
10.1016/j.amc.2020.125912
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A connected graph is called a hi-block graph if each of its blocks is a complete bipartite graph. Let B(k, alpha) be the class of hi-block graph on k vertices with given independence number alpha. It is easy to see that every hi-block graph is a bipartite graph. For a bipartite graph G on k vertices, the independence number alpha(G) satisfies inverted right perpendicular k/2 inverted left perpendicular <= alpha(G) <= k - 1. In this article, we prove that the maximum spectral radius rho(G) among all graphs G in B(k, alpha), is uniquely attained for the complete bipartite graph ice K-alpha,K-k-alpha. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:8
相关论文
共 10 条
[1]  
Bapat R.B., 2014, Graphs and Matrices
[2]  
Conde C.M., 2020, LINEAR ALGEBRA APPL
[3]  
Feng LH, 2011, UTILITAS MATHEMATICA, V84, P33
[4]   On the spectral radius of trees with fixed diameter [J].
Guo, JM ;
Shao, JY .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 413 (01) :131-147
[5]   On the spectral radius of trees with given independence number [J].
Ji, Chunyu ;
Lu, Mei .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 488 :102-108
[6]  
Li Qiao, 1979, Acta Mathematicae Applacatae Sinica, V2, P167
[7]   On the spectral radius of graphs with cut edges [J].
Liu, HQ ;
Lu, M ;
Tian, F .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 389 :139-145
[8]   Maximum spectral radius of graphs with given connectivity, minimum degree and independence number [J].
Lu, Hongliang ;
Lin, Yuqing .
JOURNAL OF DISCRETE ALGORITHMS, 2015, 31 :113-119
[9]   The spectral radius of trees on k pendant vertices [J].
Wu, BF ;
Xiao, E ;
Hong, Y .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 395 :343-349
[10]   The minimum spectral radius of graphs with a given independence number [J].
Xu, Mimi ;
Hong, Yuan ;
Shu, Jinlong ;
Zhai, Mingqing .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 431 (5-7) :937-945