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, 2014, Volume 427, Pages 5–21 (Mi znsl6040)  

This article is cited in 9 scientific papers (total in 9 papers)

On characteristic polynomial coefficients of the Laplace matrix of a weighted digraph and all minors theorem

V. A. Buslov

St. Petersburg State University, Faculty of Physics, St. Petersburg, Russia
Full-text PDF (223 kB) Citations (9)
References:
Abstract: The simple proof of the expression of characteristic polynomial coefficients of the Laplace matrix of a weighted digraph in the form of sum over all incoming forests is submitted. The proof is based on the Laplace matrix expression as a product of weighted incidence matrices and investigation of relations between its minors and forests, which is useful to calculate all Laplace matrix minors.
Key words and phrases: weighted digraph, Laplasian matrix, Incidence matrix, spanning forest.
Received: 17.11.2014
English version:
Journal of Mathematical Sciences (New York), 2016, Volume 212, Issue 6, Pages 643–653
DOI: https://doi.org/10.1007/s10958-016-2695-3
Bibliographic databases:
Document Type: Article
UDC: 519.177
Language: Russian
Citation: V. A. Buslov, “On characteristic polynomial coefficients of the Laplace matrix of a weighted digraph and all minors theorem”, Combinatorics and graph theory. Part VII, Zap. Nauchn. Sem. POMI, 427, POMI, St. Petersburg, 2014, 5–21; J. Math. Sci. (N. Y.), 212:6 (2016), 643–653
Citation in format AMSBIB
\Bibitem{Bus14}
\by V.~A.~Buslov
\paper On characteristic polynomial coefficients of the Laplace matrix of a~weighted digraph and all minors theorem
\inbook Combinatorics and graph theory. Part~VII
\serial Zap. Nauchn. Sem. POMI
\yr 2014
\vol 427
\pages 5--21
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl6040}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3485315}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2016
\vol 212
\issue 6
\pages 643--653
\crossref{https://doi.org/10.1007/s10958-016-2695-3}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84953378361}
Linking options:
  • https://www.mathnet.ru/eng/znsl6040
  • https://www.mathnet.ru/eng/znsl/v427/p5
  • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:227
    Full-text PDF :87
    References:29
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024