| Autor: |
Kalinina, E. A., Khitrov, G. M., Pogozhev, S. V. |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2016, Vol. 1738 Issue 1, p160007-1-160007-3, 3p |
| Abstrakt: |
In this paper, linear algebra methods are applied to solve some problems of graph theory. For ordinary connected graphs, edge coverings and independent sets are considered. Some results concerning minimum edge covers and maximum matchings are proved with the help of linear algebraic approach. The problem of finding a maximum matching of a graph is fundamental both practically and theoretically, and has numerous applications, e.g., in computational chemistry and mathematical chemistry. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
