The modified first Zagreb connection index and the trees with given order and size of matchings

Sadia Noureen, B. Ahmad
{"title":"The modified first Zagreb connection index and the trees with given order and size of matchings","authors":"Sadia Noureen, B. Ahmad","doi":"10.5937/spsunp2102085n","DOIUrl":null,"url":null,"abstract":"A subset of the edge set of a graph G is called a matching in G if its elements are not adjacent in G. A matching in G with the maximum cardinality among all the matchings in G is called a maximum matching. The matching number in the graph G is the number of elements in the maximum matching of G. This present paper is devoted to the investigation of the trees, which maximize the modified first Zagreb connection index among the trees with a given order and matching number.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5937/spsunp2102085n","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A subset of the edge set of a graph G is called a matching in G if its elements are not adjacent in G. A matching in G with the maximum cardinality among all the matchings in G is called a maximum matching. The matching number in the graph G is the number of elements in the maximum matching of G. This present paper is devoted to the investigation of the trees, which maximize the modified first Zagreb connection index among the trees with a given order and matching number.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
修改后的第一个萨格勒布连接索引和给定匹配顺序和大小的树
图G的边集的子集,如果其元素在G中不相邻,则称为G中的匹配。在G中的所有匹配中,基数最大的匹配称为G中的最大匹配。图G中的匹配数是图G的最大匹配中的元素数。本文研究了在给定阶数和匹配数的情况下,使修正的第一萨格勒布连接指数最大化的树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Remarks on general zeroth-order Randić and general sum-connectivity indices Generalized 2-proximal C-contraction mappings in complete ordered 2-metric space and their best proximity points The modified first Zagreb connection index and the trees with given order and size of matchings On some mathematical properties of the general zeroth-order Randić coindex of graphs Sombor index of Kragujevac trees
×
引用
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