给定最小和最大度的连通图的顶点度函数索引的若干界

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-01-01 DOI:10.46793/match.90-1.175c

X. Cheng, Xueliang Li

{"title":"给定最小和最大度的连通图的顶点度函数索引的若干界","authors":"X. Cheng, Xueliang Li","doi":"10.46793/match.90-1.175c","DOIUrl":null,"url":null,"abstract":"This paper gives some bounds for the vertex degree function index Hf(G) in terms of the order and size of a graph G, where G is a simple, finite and connected graph with minimum degree δ and maximum degree ∆. Some families of graphs are also constructed to show that the bounds can be achieved.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees\",\"authors\":\"X. Cheng, Xueliang Li\",\"doi\":\"10.46793/match.90-1.175c\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper gives some bounds for the vertex degree function index Hf(G) in terms of the order and size of a graph G, where G is a simple, finite and connected graph with minimum degree δ and maximum degree ∆. Some families of graphs are also constructed to show that the bounds can be achieved.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.90-1.175c\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.90-1.175c","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

本文根据图G的阶数和大小给出了顶点度函数指标Hf(G)的一些界，其中G是一个最小度δ，最大度∆的简单有限连通图。还构造了一些图族，以表明可以实现边界。

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

查看原文本刊更多论文

Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees

This paper gives some bounds for the vertex degree function index Hf(G) in terms of the order and size of a graph G, where G is a simple, finite and connected graph with minimum degree δ and maximum degree ∆. Some families of graphs are also constructed to show that the bounds can be achieved.

求助全文

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

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.