化学图的直径、圈数和逆度

IF 0.6 Q3 MATHEMATICS

Kyungpook Mathematical Journal Pub Date : 2020-01-01 DOI:10.5666/KMJ.2020.60.3.467

R. Sharafdini, A. Ghalavand, A. Ashrafi

{"title":"化学图的直径、圈数和逆度","authors":"R. Sharafdini, A. Ghalavand, A. Ashrafi","doi":"10.5666/KMJ.2020.60.3.467","DOIUrl":null,"url":null,"abstract":"Let G be a chemical graph with vertex set {v1, v1, . . . , vn} and degree sequence d(G) = (degG(v1), degG(v2), . . . , degG(vn)). The inverse degree, R(G) of G is defined as R(G) = ∑n i=1 1 degG(vi) . The cyclomatic number of G is defined as γ = m − n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.","PeriodicalId":46188,"journal":{"name":"Kyungpook Mathematical Journal","volume":"60 1","pages":"467-475"},"PeriodicalIF":0.6000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Diameter, Cyclomatic Number and Inverse Degree of Chemical Graphs\",\"authors\":\"R. Sharafdini, A. Ghalavand, A. Ashrafi\",\"doi\":\"10.5666/KMJ.2020.60.3.467\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a chemical graph with vertex set {v1, v1, . . . , vn} and degree sequence d(G) = (degG(v1), degG(v2), . . . , degG(vn)). The inverse degree, R(G) of G is defined as R(G) = ∑n i=1 1 degG(vi) . The cyclomatic number of G is defined as γ = m − n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.\",\"PeriodicalId\":46188,\"journal\":{\"name\":\"Kyungpook Mathematical Journal\",\"volume\":\"60 1\",\"pages\":\"467-475\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kyungpook Mathematical Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5666/KMJ.2020.60.3.467\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kyungpook Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5666/KMJ.2020.60.3.467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设G为顶点集为{v1, v1，…的化学图。， vn}，度序列d(G) = (degG(v1)， degG(v2)，…degG (vn))。G的逆度R(G)定义为R(G) =∑n i= 11 degG(vi)。G的圈数定义为γ = m−n + k，其中m、n、k分别为G的边数、顶点数和分量数。本文用化学图的反比度给出了图直径的上界。我们也得到了连接的化学图相对于反比度的排序。

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

查看原文本刊更多论文

On Diameter, Cyclomatic Number and Inverse Degree of Chemical Graphs

Let G be a chemical graph with vertex set {v1, v1, . . . , vn} and degree sequence d(G) = (degG(v1), degG(v2), . . . , degG(vn)). The inverse degree, R(G) of G is defined as R(G) = ∑n i=1 1 degG(vi) . The cyclomatic number of G is defined as γ = m − n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

求助全文

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

来源期刊

Kyungpook Mathematical Journal MATHEMATICS-

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Kyungpook Mathematical Journal is an international journal devoted to significant research concerning all aspects of mathematics. The journal has a preference for papers having a broad interest. One volume of the journal is published every year. Each volume until volume 42 consisted of two issues; however, starting from volume 43(2003), each volume consists of four issues. Authors should strive for expository clarity and good literary style. Manuscripts should be prepared as follows. The first page must consist of a short descriptive title, followed by the name(s) and address(es) of the author(s) along with an electronic address if available.