具有k个链的树和单环图的a = 1的一般和连通性索引

2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2015-09-21 DOI:10.1109/SYNASC.2015.55

Rozica-Maria Tache, I. Tomescu

{"title":"具有k个链的树和单环图的a = 1的一般和连通性索引","authors":"Rozica-Maria Tache, I. Tomescu","doi":"10.1109/SYNASC.2015.55","DOIUrl":null,"url":null,"abstract":"One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as χα(G) = ΣuvϵE(G)(d(u) + d(v))α, where d(u) denotes the degree of vertex u in G and is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for α ≥ 1,with 2 ≤ k ≤ n for trees and 0 ≤ k ≤ n - 3 for unicyclic graphs.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"82 1","pages":"307-311"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants\",\"authors\":\"Rozica-Maria Tache, I. Tomescu\",\"doi\":\"10.1109/SYNASC.2015.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as χα(G) = ΣuvϵE(G)(d(u) + d(v))α, where d(u) denotes the degree of vertex u in G and is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for α ≥ 1,with 2 ≤ k ≤ n for trees and 0 ≤ k ≤ n - 3 for unicyclic graphs.\",\"PeriodicalId\":6488,\"journal\":{\"name\":\"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"82 1\",\"pages\":\"307-311\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2015.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2015.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

图G的一般和连通性指标是最新的分子描述符之一，定义为χα(G) = ΣuvϵE(G)(d(u) + d(v))α，其中d(u)表示顶点u在G中的度，为实数。本文的目的是确定在α≥1,2≤k≤n, 0≤k≤n - 3的情况下，有k个垂顶点的树和单环图的一般和连通性指数最大。

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

查看原文

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

本刊更多论文

General Sum-Connectivity Index with a = 1 for Trees and Unicyclic Graphs with k Pendants

One of the newest molecular descriptors, the general sum-connectivity index of a graph G is defined as χ_α(G) = Σ_uvϵE(G)(d(u) + d(v))α, where d(u) denotes the degree of vertex u in G and is a real number. The aim of this paper is to determine the trees and the unicyclic graphs with k pendant vertices that maximize the general sum-connectivity index for α ≥ 1,with 2 ≤ k ≤ n for trees and 0 ≤ k ≤ n - 3 for unicyclic graphs.

求助全文

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

来源期刊

2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量