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

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":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4213/sm9745e","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","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.
分享
查看原文
在直径$5$的树上有最大数目的匹配
图中的匹配是图中没有公共顶点的任何边的集合。图的匹配数,又称细谷指数,是一个重要的参数,在数学化学中有着广泛的应用。在此之前,已经完全解决了固定大小的半径$2$(即直径$4$)树的Hosoya指数最大化问题。本文研究了直径$5$树在固定数目$n$顶点上的Hosoya指数最大化问题,并完全解决了这一问题。对于任意n,极值树都是唯一的。参考书目:6篇。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
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学术官方微信