On diameter $5$ trees with the maximum number of matchings

IF 0.8 4区 数学 Q2 MATHEMATICS Sbornik Mathematics Pub Date : 2023-01-01 DOI:10.4213/sm9745e
N. A. Kuz’min, D. Malyshev
{"title":"On diameter $5$ trees with the maximum number of matchings","authors":"N. A. Kuz’min, D. Malyshev","doi":"10.4213/sm9745e","DOIUrl":null,"url":null,"abstract":"A matching in a graph is any set of edges of this graph without common vertices. The number of matchings, also known as the Hosoya index of the graph, is an important parameter, which finds wide applications in mathematical chemistry. Previously, the problem of maximizing the Hosoya index in trees of radius $2$ (that is, diameter $4$) of fixed size was completely solved. This work considers the problem of maximizing the Hosoya index in trees of diameter $5$ on a fixed number $n$ of vertices and solves it completely. It turns out that for any $n$ the extremal tree is unique. Bibliography: 6 titles.","PeriodicalId":49573,"journal":{"name":"Sbornik Mathematics","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sbornik Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4213/sm9745e","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A matching in a graph is any set of edges of this graph without common vertices. The number of matchings, also known as the Hosoya index of the graph, is an important parameter, which finds wide applications in mathematical chemistry. Previously, the problem of maximizing the Hosoya index in trees of radius $2$ (that is, diameter $4$) of fixed size was completely solved. This work considers the problem of maximizing the Hosoya index in trees of diameter $5$ on a fixed number $n$ of vertices and solves it completely. It turns out that for any $n$ the extremal tree is unique. Bibliography: 6 titles.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在直径$5$的树上有最大数目的匹配
图中的匹配是图中没有公共顶点的任何边的集合。图的匹配数,又称细谷指数,是一个重要的参数,在数学化学中有着广泛的应用。在此之前,已经完全解决了固定大小的半径$2$(即直径$4$)树的Hosoya指数最大化问题。本文研究了直径$5$树在固定数目$n$顶点上的Hosoya指数最大化问题,并完全解决了这一问题。对于任意n,极值树都是唯一的。参考书目:6篇。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Sbornik Mathematics
Sbornik Mathematics 数学-数学
CiteScore
1.40
自引率
12.50%
发文量
37
审稿时长
6-12 weeks
期刊介绍: The Russian original is rigorously refereed in Russia and the translations are carefully scrutinised and edited by the London Mathematical Society. The journal has always maintained the highest scientific level in a wide area of mathematics with special attention to current developments in: Mathematical analysis Ordinary differential equations Partial differential equations Mathematical physics Geometry Algebra Functional analysis
期刊最新文献
Sharp Bernstein-type inequalities for Fourier-Dunkl multipliers On diameter $5$ trees with the maximum number of matchings Structure of the spectrum of a nonselfadjoint Dirac operator Classification of Liouville foliations of integrable topological billiards in magnetic fields On uniqueness for Franklin series with a convergent subsequence of partial sums
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1