On the spectral radius of bi-block graphs with given independence number
Authors:
- Joyentanuj DasJDJoyentanuj Das
- Sumit MohantySMSumit Mohanty
- 1 August 2021
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 402
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Anusandhan National Research Foundation
This publication has 6 references indexed in Scilit:
- On the spectral radius of trees with given independence numberLinear Algebra and its Applications, 2016
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence numberJournal of Discrete Algorithms, 2015
- The minimum spectral radius of graphs with a given independence numberLinear Algebra and its Applications, 2009
- On the spectral radius of trees with fixed diameterLinear Algebra and its Applications, 2006
- The spectral radius of trees on k pendant verticesLinear Algebra and its Applications, 2005
- On the spectral radius of graphs with cut edgesLinear Algebra and its Applications, 2004