In this paper we consider some problems of graph theory from the linear algebra point of view. It turns out, that this approach allows us to prove certain theorems on minimum edge coverings and maximum matchings and develop a new algorithm to recognize a line graph and construct its original graph.

Original languageEnglish
Title of host publication2015 International Conference on "Stability and Control Processes" in Memory of V.I. Zubov, SCP 2015 - Proceedings
EditorsL. A. Petrosyan, A. P. Zhabko
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages570-572
Number of pages3
ISBN (Electronic)9781467376983
ISBN (Print)9781467376983
DOIs
StatePublished - 30 Nov 2015
EventInternational Conference on "Stability and Control Processes" in Memory of V.I. Zubov, SCP 2015 - Петергоф, St. Petersburg, Russian Federation
Duration: 5 Oct 20159 Oct 2015
http://www.apmath.spbu.ru/scp2015/openconf.php

Publication series

Name2015 International Conference on "Stability and Control Processes" in Memory of V.I. Zubov, SCP 2015 - Proceedings

Conference

ConferenceInternational Conference on "Stability and Control Processes" in Memory of V.I. Zubov, SCP 2015
Abbreviated titleSCP 2015
Country/TerritoryRussian Federation
CitySt. Petersburg
Period5/10/159/10/15
Internet address

    Research areas

  • Bismuth, Electronic mail, Graph theory, Linear algebra, Scheduling, Standards, Yttrium

    Scopus subject areas

  • Computational Mechanics
  • Control and Systems Engineering

ID: 3984655