caa a22 4500 378855719 CHVBK 20180305123334.0 cr unu---uuuuu 161128e20031201xx s 000 0 eng 10.1515/156939203322733309 doi (NATIONALLICENCE)gruyter-10.1515/156939203322733309 Kolmykov V. A. Inert matrices and matchings in partially oriented trees [Elektronische Daten] [V. A. Kolmykov] 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. Copyright 2003, Walter de Gruyter Discrete Mathematics and Applications Walter de Gruyter 13/6(2003-12-01), 607-612 0924-9265 13:6<607 2003 13 dma https://doi.org/10.1515/156939203322733309 text/html Onlinezugriff via DOI 1 research article jats NATIONALLICENCE 856 40 https://doi.org/10.1515/156939203322733309 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Kolmykov V. A. NATIONALLICENCE 773 0- Discrete Mathematics and Applications Walter de Gruyter 13/6(2003-12-01), 607-612 0924-9265 13:6<607 2003 13 dma CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-gruyter