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.
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 callDisclaimer: 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.
