α-指数的极值图

Revista Integración Pub Date : 2020-01-27 DOI:10.18273/revint.v38n1-202002

Eber Lenes, Henry García, Ariel Figueroa, Fabian Mercado

{"title":"α-指数的极值图","authors":"Eber Lenes, Henry García, Ariel Figueroa, Fabian Mercado","doi":"10.18273/revint.v38n1-202002","DOIUrl":null,"url":null,"abstract":"Let N(G) be the number of vertices of the graph G. Let Pl(Bi) be the tree obtained of the path Pl and the trees B1, B2, ..., Bl by identifying the root vertex of Bi with the i-th vertex of Pl. Let Vm n = {Pl(Bi) : N(Pl(Bi)) = n;N(Bi) ≥ 2; l ≥ m}. In this paper, we determine the tree that has the largest α-index among all the trees in Vm n .","PeriodicalId":402331,"journal":{"name":"Revista Integración","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Extremal graphs for α- index\",\"authors\":\"Eber Lenes, Henry García, Ariel Figueroa, Fabian Mercado\",\"doi\":\"10.18273/revint.v38n1-202002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let N(G) be the number of vertices of the graph G. Let Pl(Bi) be the tree obtained of the path Pl and the trees B1, B2, ..., Bl by identifying the root vertex of Bi with the i-th vertex of Pl. Let Vm n = {Pl(Bi) : N(Pl(Bi)) = n;N(Bi) ≥ 2; l ≥ m}. In this paper, we determine the tree that has the largest α-index among all the trees in Vm n .\",\"PeriodicalId\":402331,\"journal\":{\"name\":\"Revista Integración\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Revista Integración\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18273/revint.v38n1-202002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista Integración","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18273/revint.v38n1-202002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设N(G)为图G的顶点数，设Pl(Bi)为路径Pl和树B1, B2，…所得到的树令Vm n = {Pl(Bi): n (Pl(Bi)) = n; n (Bi)≥2;L≥m}。在本文中，我们确定了vmn中所有树中α-索引最大的树。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Extremal graphs for α- index

Let N(G) be the number of vertices of the graph G. Let Pl(Bi) be the tree obtained of the path Pl and the trees B1, B2, ..., Bl by identifying the root vertex of Bi with the i-th vertex of Pl. Let Vm n = {Pl(Bi) : N(Pl(Bi)) = n;N(Bi) ≥ 2; l ≥ m}. In this paper, we determine the tree that has the largest α-index among all the trees in Vm n .

求助全文

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

来源期刊

Revista Integración

自引率

0.00%

发文量