О пучке паросочетаний графа и свойствах его характеристического многочлена

IF 0.2 Q4 MATHEMATICS, APPLIED
А. И. Болотников, Alexey Igorevich Bolotnikov
{"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

В работе изучается пучок гиперплоскостей, построенный по подмножеству множества всех простых путей графа. Установлена связь построенного пучка и задачи о максимальном паросочетании. Задача нахождения характеристического многочлена построенного пучка сведена к случаю связного графа. Также найден характеристический многочлен для случая, когда исходный граф - дерево.
图的匹配光束及其特征多项式性质
它是根据图中许多简单路径的子集构建的超平面束的研究。建立一个连接到构建的光束和最大匹配目标。找到构建光束的特征多项式的任务简化为连通图的情况。在原始图树的情况下还发现了一个特征多项式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Prikladnaya Diskretnaya Matematika
Prikladnaya Diskretnaya Matematika MATHEMATICS, APPLIED-
CiteScore
0.60
自引率
50.00%
发文量
0
期刊介绍: 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;[...]
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信