Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees
-
Published:2023
Issue:1
Volume:90
Page:175-186
-
ISSN:0340-6253
-
Container-title:Match Communications in Mathematical and in Computer Chemistry
-
language:
-
Short-container-title:match
Author:
Cheng Xin, ,Li Xueliang
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.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. (n,m)-Graphs with Maximum Vertex–Degree Function–Index for Convex Functions;Match - Communications in Mathematical and in Computer Chemistry;2023-10