On the matching arrangement of a graph and properties of its characteristic polynomial

preprint2022arXivOpen access

Abstract

This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding the characteristic polynomial is reduced to the case of a connected initial graph. The formula of the characteristic polynomial was also found for the case, when the initial graph is a tree.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.