Skip to main content

Advertisement

SpringerLink
Log in

Structure of Minimum-Weight Directed Forests: Related Forests and Convexity Inequalities

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

A toolkit has been developed that allows one to build directed forests from other directed forests. With its help, inequalities are proved, which connect the weights of minimal directed forests with different numbers of trees in them. A theorem on the minimum necessary changes that must be made in the minimal directed forest is also proved in order to obtain another minimal directed forest with the number of roots different by one. Bibliography: 10 titles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. D. Ventsel, “On the asymptotics of eigenvalues of matrices with elements of order exp{−Vij/2ε2},” Dokl. Akad. Nauk SSSR, 202, No. 2, 263–266 (1972).

  2. A. D. Ventsel and M. I. Freidlin, Fluctuations in Dynamic Systems Under Small Random Disturbance [in Russian], Moscow (1979).

  3. V. A. Buslov and K. A. Makarov, “Hierarchy of time scales in the case of weak diffusion,” Teor. Mat. Fiz., 76, No. 2, 219–230 (1988).

    Article  Google Scholar 

  4. V. A. Buslov and K. A. Makarov, “Lifetimes and lower eigenvalues of an operator of small diffusion,” Mat. Zam., 51, No. 1, 20–31 (1992).

    MATH  Google Scholar 

  5. V. A. Buslov, “On characteristic polynomial and eigenvectors in terms of tree structure of a digraph,” Zap. Nauchn. Semin. POMI, 450, 14–36 (2016).

    Google Scholar 

  6. V. A. Buslov, “On the relationship between multiplicities of the matrix spectrum and signs of components of its eigenvector in a tree-like structure,” Zap. Nauchn. Semin. POMI, 464, 5–25 (2017).

    Google Scholar 

  7. V. A. Buslov, “On the characteristic polynomial coefficients of the Laplace matrix of a weighted digraph and the all minors theorem,” Zap. Nauchn. Semin. POMI, 427, 5–21 (2014).

    Google Scholar 

  8. S. Chaiken, “A combinatorial proof of the all minors matrix tree theorem,” SIAM J. Alg. Dis. Meth., 3, No. 3, 319–329 (1982).

  9. J. W. Moon, “Some determinant expansions and the matrix-tree theorem,” Discrete Mathematics, 124, 163–171 (1994).

    Article  MathSciNet  Google Scholar 

  10. P. Chebotarev and R. Agaev, “Forest matrices around the Laplacian matrix,” Lin. Algebra Appl., 356, 253–274 (2002).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St.Petersburg State University, St.Petersburg, Russia

    V. A. Buslov

Authors
  1. V. A. Buslov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Buslov.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 475, 2018, pp. 5–21.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Buslov, V.A. Structure of Minimum-Weight Directed Forests: Related Forests and Convexity Inequalities. J Math Sci 247, 383–393 (2020). https://doi.org/10.1007/s10958-020-04808-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-020-04808-y

Search

Navigation