On the extremal total irregularity index of n-vertex trees with fixed maximum degree

Authors

Abstract:

In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees and italso calculates the index.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

On total vertex-irregularity strength of trees

A vertex-irregular total k-labelling λ : V (G)∪E(G) −→ {1, 2, ..., k} of a graph G is a labelling of vertices and edges of G in such a way that for any different vertices x and y, their weights wt(x) and wt(y) are distinct. The weight wt(x) of a vertex x is the sum of the label of x and the labels of all edges incident with x. The minimum k for which a graph G has a vertex-irregular total k-lab...

full text

Total vertex irregularity strength of corona product of some graphs

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

full text

On total vertex irregularity strength of graphs

Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.

full text

The Maximum Wiener Index of Trees with Given Degree Sequences

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.

full text

The Variable Wiener Index of Trees with Given Maximum Degree

 The work is supported by Training and plan projects of college students' innovation and pioneering in Guangdong Province(No.1056412059). Abstract Wiener index proposed by Harold Wiener in 1947 is a very important topological index which is widely applied in chemical research. Gutman et al. extended the Wiener index to variable Wiener index. M. H. Liu et al. obtained the maximum variable Wiene...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 6  issue 1

pages  113- 121

publication date 2021-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023