Standard

Edge covers and independence : Algebraic approach. / Kalinina, E. A.; Khitrov, G. M.; Pogozhev, S. V.

International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015. ред. / T Simos; C Tsitouras. American Institute of Physics, 2016. 160007 (AIP Conference Proceedings; Том 1738).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Kalinina, EA, Khitrov, GM & Pogozhev, SV 2016, Edge covers and independence: Algebraic approach. в T Simos & C Tsitouras (ред.), International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015., 160007, AIP Conference Proceedings, Том. 1738, American Institute of Physics, International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015, Rhodes, Греция, 23/09/15. https://doi.org/10.1063/1.4951940

APA

Kalinina, E. A., Khitrov, G. M., & Pogozhev, S. V. (2016). Edge covers and independence: Algebraic approach. в T. Simos, & C. Tsitouras (Ред.), International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015 [160007] (AIP Conference Proceedings; Том 1738). American Institute of Physics. https://doi.org/10.1063/1.4951940

Vancouver

Kalinina EA, Khitrov GM, Pogozhev SV. Edge covers and independence: Algebraic approach. в Simos T, Tsitouras C, Редакторы, International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015. American Institute of Physics. 2016. 160007. (AIP Conference Proceedings). https://doi.org/10.1063/1.4951940

Author

Kalinina, E. A. ; Khitrov, G. M. ; Pogozhev, S. V. / Edge covers and independence : Algebraic approach. International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015. Редактор / T Simos ; C Tsitouras. American Institute of Physics, 2016. (AIP Conference Proceedings).

BibTeX

@inproceedings{39126c8e0b944157a8e08ceb42717797,
title = "Edge covers and independence: Algebraic approach",
abstract = "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.",
keywords = "connected ordinary graphs, edge covers, edge independent sets",
author = "Kalinina, {E. A.} and Khitrov, {G. M.} and Pogozhev, {S. V.}",
note = "Publisher Copyright: {\textcopyright} 2016 Author(s).; International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015, ICNAAM ; Conference date: 23-09-2015 Through 29-09-2015",
year = "2016",
month = jun,
day = "8",
doi = "10.1063/1.4951940",
language = "English",
series = "AIP Conference Proceedings",
publisher = "American Institute of Physics",
editor = "T Simos and C Tsitouras",
booktitle = "International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015",
address = "United States",
url = "https://elibrary.ru/item.asp?id=26404479, http://history.icnaam.org/icnaam_2015/index-2.html",

}

RIS

TY - GEN

T1 - Edge covers and independence

T2 - International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015

AU - Kalinina, E. A.

AU - Khitrov, G. M.

AU - Pogozhev, S. V.

N1 - Publisher Copyright: © 2016 Author(s).

PY - 2016/6/8

Y1 - 2016/6/8

N2 - 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.

AB - 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.

KW - connected ordinary graphs

KW - edge covers

KW - edge independent sets

UR - http://www.scopus.com/inward/record.url?scp=84984567323&partnerID=8YFLogxK

U2 - 10.1063/1.4951940

DO - 10.1063/1.4951940

M3 - Conference contribution

T3 - AIP Conference Proceedings

BT - International Conference of Numerical Analysis and Applied Mathematics 2015, ICNAAM 2015

A2 - Simos, T

A2 - Tsitouras, C

PB - American Institute of Physics

Y2 - 23 September 2015 through 29 September 2015

ER -

ID: 86494831