Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2017, Volume 463, Pages 240–262 (Mi znsl6515)  

An approach to bounding the spectral radius of a weighted digraph

L. Yu. Kolotilina

St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences, St. Petersburg, Russia
References:
Abstract: The paper suggests a general approach to deriving upper bounds for the spectral radii of weighted graphs and digraphs. The approach is based on the generalized Wielandt lemma (GWL), which reduces the problem of bounding the spectral radius of a given block matrix to bounding the Perron root of the matrix composed of the norms of the blocks. In the case of the adjacency matrix of weighted graphs and digraphs, where all the blocks are square positive semidefinite matrices of the same order, the GWL takes an especially nice simple form. The second component of the approach consists in applying known upper bounds for the Perron root of a nonnegative matrix. It is shown that the approach suggested covers, in particular, the known upper bounds of the spectral radius and allows one to describe the equality cases.
Key words and phrases: weighted digraph, adjacency matrix, spectral radius, Wielandt's lemma, block matrix, nonnegative matrix, Perron root, upper bound.
Received: 16.10.2017
English version:
Journal of Mathematical Sciences (New York), 2018, Volume 232, Issue 6, Pages 903–916
DOI: https://doi.org/10.1007/s10958-018-3917-7
Bibliographic databases:
Document Type: Article
UDC: 512.643
Language: Russian
Citation: L. Yu. Kolotilina, “An approach to bounding the spectral radius of a weighted digraph”, Computational methods and algorithms. Part XXX, Zap. Nauchn. Sem. POMI, 463, POMI, St. Petersburg, 2017, 240–262; J. Math. Sci. (N. Y.), 232:6 (2018), 903–916
Citation in format AMSBIB
\Bibitem{Kol17}
\by L.~Yu.~Kolotilina
\paper An approach to bounding the spectral radius of a~weighted digraph
\inbook Computational methods and algorithms. Part~XXX
\serial Zap. Nauchn. Sem. POMI
\yr 2017
\vol 463
\pages 240--262
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl6515}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2018
\vol 232
\issue 6
\pages 903--916
\crossref{https://doi.org/10.1007/s10958-018-3917-7}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049078002}
Linking options:
  • https://www.mathnet.ru/eng/znsl6515
  • https://www.mathnet.ru/eng/znsl/v463/p240
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :60
    References:35
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025