Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2003, Volume 15, Issue 4, Pages 119–125
DOI: https://doi.org/10.4213/dm220 (Mi dm220) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Inert matrices and matchings in partially oriented trees

V. A. Kolmykov
Full-text PDF (824 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm220
Abstract: We study inert matrices which remain degenerate or non-degenerate under any replacement of their non-zero elements by other non-zero numbers. In partially oriented graphs, we consider non-oriented matchings. We discuss a quantum model which fit these matchings. We prove that both perfect and imperfect oriented trees (that is, possessing and not possessing a perfect matching) may be obtained from the elementary ones with the use of some operations, that is, the set of the perfect trees and the set of the imperfect trees are free finitely generated algebraic structures.
Received: 13.12.2001
Revised: 08.10.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 6, Pages 607–612
DOI: https://doi.org/10.1515/156939203322733309
Bibliographic databases:
UDC: 519.17
Language: Russian
Citation: V. A. Kolmykov, “Inert matrices and matchings in partially oriented trees”, Diskr. Mat., 15:4 (2003), 119–125; Discrete Math. Appl., 13:6 (2003), 607–612
Citation in format AMSBIB
\Bibitem{Kol03}
\by V.~A.~Kolmykov
\paper Inert matrices and matchings in partially oriented trees
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 4
\pages 119--125
\mathnet{http://mi.mathnet.ru/dm220}
\crossref{https://doi.org/10.4213/dm220}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2050753}
\zmath{https://zbmath.org/?q=an:1048.05060}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 6
\pages 607--612
\crossref{https://doi.org/10.1515/156939203322733309}
Linking options:
  • https://www.mathnet.ru/eng/dm220
  • https://doi.org/10.4213/dm220
  • https://www.mathnet.ru/eng/dm/v15/i4/p119
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:380
    Full-text PDF :255
    References:64
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024