On 5- and 6-Leaved Trees with the Largest Number of Matchings

IF 0.6 4区 数学 Q3 MATHEMATICS Mathematical Notes Pub Date : 2024-07-05 DOI:10.1134/s0001434624030064
N. A. Kuz’min, D. S. Malyshev
{"title":"On 5- and 6-Leaved Trees with the Largest Number of Matchings","authors":"N. A. Kuz’min, D. S. Malyshev","doi":"10.1134/s0001434624030064","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p> A matching of a graph is a set of its edges that pairwise do not have common vertices. An important parameter of graphs, which is used in mathematical chemistry, is the Hosoya index, defined as the number of their matchings. Previously, the problems of maximizing this index were considered and completely solved for <span>\\(n\\)</span>-vertex trees with two, three and four leaves for any sufficiently large <span>\\(n\\)</span>. In the present paper, a similar problem is completely solved for 5-leaved trees with <span>\\(n\\geq 20\\)</span> and for 6-leaved trees with <span>\\(n\\geq 26\\)</span>. </p>","PeriodicalId":18294,"journal":{"name":"Mathematical Notes","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Notes","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s0001434624030064","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A matching of a graph is a set of its edges that pairwise do not have common vertices. An important parameter of graphs, which is used in mathematical chemistry, is the Hosoya index, defined as the number of their matchings. Previously, the problems of maximizing this index were considered and completely solved for \(n\)-vertex trees with two, three and four leaves for any sufficiently large \(n\). In the present paper, a similar problem is completely solved for 5-leaved trees with \(n\geq 20\) and for 6-leaved trees with \(n\geq 26\).

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于匹配数最多的五叶树和六叶树
摘要 图的匹配是指图中没有共同顶点的成对边的集合。在数学化学中,图的一个重要参数是细谷指数(Hosoya index),它被定义为图的匹配数。在此之前,对于任意足够大的\(n\),具有两叶、三叶和四叶的\(n\)-顶点树,已经考虑并完全解决了最大化该指数的问题。在本文中,一个类似的问题被完全解决了,即对于有5片叶子的树(\(n\geq 20\) 和有\(n\geq 26\) 的6片叶子的树(\(n\geq 26\) )。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematical Notes
Mathematical Notes 数学-数学
CiteScore
0.90
自引率
16.70%
发文量
179
审稿时长
24 months
期刊介绍: Mathematical Notes is a journal that publishes research papers and review articles in modern algebra, geometry and number theory, functional analysis, logic, set and measure theory, topology, probability and stochastics, differential and noncommutative geometry, operator and group theory, asymptotic and approximation methods, mathematical finance, linear and nonlinear equations, ergodic and spectral theory, operator algebras, and other related theoretical fields. It also presents rigorous results in mathematical physics.
期刊最新文献
On the Existence of a Nonextendable Solution of the Cauchy problem for a $$(1+1)$$ -Dimensional Thermal-Electrical Model Two-Sided Estimates of Solutions with a Blow-Up Mode for a Nonlinear Heat Equation with a Quadratic Source On the Unique Solvability of Nonlocal Problems for Abstract Singular Equations Analytic Complexity: Functions with One-Dimensional Stabilizer in the Gauge Group On Disjointness-Preserving Biadditive Operators
×
引用
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