Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2023, Volume 35, Issue 2, Pages 3–17
DOI: https://doi.org/10.4213/dm1718 (Mi dm1718) 		 
This article is cited in 1 scientific paper (total in 1 paper)

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

A. I. Bolotnikov

Lomonosov Moscow State University
Full-text PDF (516 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1718
Abstract: We consider a hyperplane arrangement constructed from a subset of the set of all simple paths in a graph. A relation of the constructed arrangement to the maximum matching problem is established. In addition, the problem of finding the characteristic polynomial is reduced to the case of a connected original graph. In the case where the original graph is a tree, a formula for the characteristic polynomial is obtained.
Keywords: hyperplane arrangement, graphical arrangement, partially ordered set, matroid, maximal matching problem.
Received: 12.05.2022
English version:
Discrete Mathematics and Applications, 2024, Volume 34, Issue 5, Pages 251–261
DOI: https://doi.org/10.1515/dma-2024-0022
Document Type: Article
UDC: 519.171
Language: Russian
Citation: A. I. Bolotnikov, “On the matching arrangement of a graph and properties of its characteristic polynomial”, Diskr. Mat., 35:2 (2023), 3–17; Discrete Math. Appl., 34:5 (2024), 251–261
Citation in format AMSBIB
\Bibitem{Bol23}
\by A.~I.~Bolotnikov
\paper On the matching arrangement of a~graph and properties of its characteristic polynomial
\jour Diskr. Mat.
\yr 2023
\vol 35
\issue 2
\pages 3--17
\mathnet{http://mi.mathnet.ru/dm1718}
\crossref{https://doi.org/10.4213/dm1718}
\transl
\jour Discrete Math. Appl.
\yr 2024
\vol 34
\issue 5
\pages 251--261
\crossref{https://doi.org/10.1515/dma-2024-0022}
Linking options:
  • https://www.mathnet.ru/eng/dm1718
  • https://doi.org/10.4213/dm1718
  • https://www.mathnet.ru/eng/dm/v35/i2/p3
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:205
    Full-text PDF :18
    References:32
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024