Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.