Open Access
Issue |
RAIRO-Oper. Res.
Volume 58, Number 5, September-October 2024
|
|
---|---|---|
Page(s) | 4575 - 4588 | |
DOI | https://doi.org/10.1051/ro/2024181 | |
Published online | 21 October 2024 |
- M. Aouchiche and P. Hansen, Distance spectra of graphs: A survey. Linear Algebra Appl. 458 (2014) 301–386. [CrossRef] [MathSciNet] [Google Scholar]
- Y.Y. Chen, H.Q. Lin and J.L. Shu, Sharp upper bounds on the distance spectral radius of a graph. Linear Algebra Appl. 439 (2013) 2659–2666. [CrossRef] [MathSciNet] [Google Scholar]
- S.Y. Cui, J.X. He and G.X. Tian, The generalized distance matrix. Linear Algebra Appl. 563 (2019) 1–23. [CrossRef] [MathSciNet] [Google Scholar]
- R.C. Diaz, G. Pasten and O. Rojo, On the minimal Dα-spectral radius of graphs subject to fixed connectivity. Linear Algebra Appl. 584 (2020) 353–370. [CrossRef] [MathSciNet] [Google Scholar]
- R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge University Press, New York (1985). [CrossRef] [Google Scholar]
- D. Li, G.P. Wang and J.X. Meng, Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs. Appl. Math. Comput. 293 (2017) 218–225. [MathSciNet] [Google Scholar]
- D. Li, G.P. Wang and J.X. Meng, On the distance signless Laplacian spectral radius of graphs and digraphs. Electron. J. Linear Algebra 32 (2017) 438–446. [CrossRef] [MathSciNet] [Google Scholar]
- H.Q. Lin and J.L. Shu, The distance spectral radius of digraphs. Discrete Appl. Math. 161 (2013) 2537–2543. [CrossRef] [MathSciNet] [Google Scholar]
- H.Q. Lin and X.W. Lu, Bounds on the distance signless Laplacian spectral radius in terms of clique number. Linear Multilinear Algebra 63 (2015) 1750–1759. [CrossRef] [MathSciNet] [Google Scholar]
- J. Monsalve and J. Rada, Bicyclic digraphs with maximal energy. Appl. Math. Comput. 280 (2016) 124–131. [MathSciNet] [Google Scholar]
- I. Peña and J. Rada, Energy of digraphs. Linear Multilinear Algebra 56 (2008) 565–579. [CrossRef] [MathSciNet] [Google Scholar]
- X.Q. Qi, E. Fuller, R. Luo, G.D. Guo and C.Q. Zhang, Laplacian energy of digraphs and a minimum Laplacian energy algorithms. Int. J. Found. Comput. Sci. 26 (2015) 367–380. [CrossRef] [Google Scholar]
- W.G. Xi, On the Dα spectral radius of strongly connected digraphs. Filomat 35 (2021) 1289–1304. [CrossRef] [MathSciNet] [Google Scholar]
- W.G. Xi and L.G. Wang, Bounds for the signless Laplacian energy of digraphs. Indian J. Pure Appl. Math. 48 (2017) 411–421. [CrossRef] [MathSciNet] [Google Scholar]
- W.G. Xi, W. So and L.G. Wang, The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity. Linear Algebra Appl. 581 (2019) 85–111. [CrossRef] [MathSciNet] [Google Scholar]
- W.G. Xi, W. So and L.G. Wang, The generalized distance matrix of digraphs. Linear Algebra Appl. 577 (2019) 270–286. [CrossRef] [MathSciNet] [Google Scholar]
- W.G. Xi, W. So and L.G. Wang, On the distance spectral radius of digraphs with given diameter. Linear Multilinear Algebra 69 (2021) 2547–2557. [CrossRef] [MathSciNet] [Google Scholar]
- X.W. Yang and L.G. Wang, Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs. Appl. Math. Comput. 366 (2020) 124737. [MathSciNet] [Google Scholar]
- Y.K. Zhang and H.Q. Lin, Perfect matching and distance spectral radius in graphs and bipartite graphs. Discrete Appl. Math. 304 (2021) 315–322. [CrossRef] [MathSciNet] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.