修改后的第一个萨格勒布连接索引和给定匹配顺序和大小的树

Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics Pub Date : 1900-01-01 DOI:10.5937/spsunp2102085n

Sadia Noureen, B. Ahmad

{"title":"修改后的第一个萨格勒布连接索引和给定匹配顺序和大小的树","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":"{\"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}","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

摘要

图G的边集的子集，如果其元素在G中不相邻，则称为G中的匹配。在G中的所有匹配中，基数最大的匹配称为G中的最大匹配。图G中的匹配数是图G的最大匹配中的元素数。本文研究了在给定阶数和匹配数的情况下，使修正的第一萨格勒布连接指数最大化的树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics

自引率

0.00%

发文量