{"title":"О пучке паросочетаний графа и свойствах его характеристического многочлена","authors":"А. И. Болотников, Alexey Igorevich Bolotnikov","doi":"10.4213/dm1718","DOIUrl":null,"url":null,"abstract":"В работе изучается пучок гиперплоскостей, построенный по подмножеству множества всех простых путей графа. Установлена связь построенного пучка и задачи о максимальном паросочетании. Задача нахождения характеристического многочлена построенного пучка сведена к случаю связного графа. Также найден характеристический многочлен для случая, когда исходный граф - дерево.","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"12 1","pages":""},"PeriodicalIF":0.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Prikladnaya Diskretnaya Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4213/dm1718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 1
Abstract
В работе изучается пучок гиперплоскостей, построенный по подмножеству множества всех простых путей графа. Установлена связь построенного пучка и задачи о максимальном паросочетании. Задача нахождения характеристического многочлена построенного пучка сведена к случаю связного графа. Также найден характеристический многочлен для случая, когда исходный граф - дерево.
期刊介绍：
The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008). Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index). The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English. The topics of the journal are the following: 1.theoretical foundations of applied discrete mathematics – algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings; 2.mathematical methods in cryptography – synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography; 3.mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security; 4.mathematical foundations of computer security – mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;[...]
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
