The irregularity of two types of trees

Jianxi Li; Yang Liu; Wai Chee Shiu

doi:10.46298/dmtcs.2146

The irregularity of two types of trees

Jianxi Li, Yang Liu, Wai Chee Shiu

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

4 Citations (Scopus)

Abstract

The irregularity of a graph G is defined as the sum of weights d(u) - d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively.

Original language	English
Pages (from-to)	203-216
Number of pages	14
Journal	Discrete Mathematics and Theoretical Computer Science
Volume	17
Issue number	3
DOIs	https://doi.org/10.46298/dmtcs.2146
Publication status	Published - 8 Jun 2016

Scopus Subject Areas

Theoretical Computer Science
General Computer Science
Discrete Mathematics and Combinatorics

User-Defined Keywords

Branching number
Degree sequence
Irregularity
Trees

Access to Document

10.46298/dmtcs.2146

Cite this

@article{406cc2d9afdb42adae3377c824502c40,

title = "The irregularity of two types of trees",

abstract = "The irregularity of a graph G is defined as the sum of weights d(u) - d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively.",

keywords = "Branching number, Degree sequence, Irregularity, Trees",

author = "Jianxi Li and Yang Liu and Shiu, {Wai Chee}",

note = "Funding Information: This work is partially supported by NSF of China (Nos.11101358, 61379021, 11471077); NSF of Fujian (Nos.2014J01020, 2015J01018, 2016J01673); China Postdoctoral Science Foundation (No.2014M551831); General Research Fund of Hong Kong and Faculty Research Grant of Hong Kong Baptist University.",

year = "2016",

month = jun,

day = "8",

doi = "10.46298/dmtcs.2146",

language = "English",

volume = "17",

pages = "203--216",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1462-7264",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "3",

}

TY - JOUR

T1 - The irregularity of two types of trees

AU - Li, Jianxi

AU - Liu, Yang

AU - Shiu, Wai Chee

N1 - Funding Information: This work is partially supported by NSF of China (Nos.11101358, 61379021, 11471077); NSF of Fujian (Nos.2014J01020, 2015J01018, 2016J01673); China Postdoctoral Science Foundation (No.2014M551831); General Research Fund of Hong Kong and Faculty Research Grant of Hong Kong Baptist University.

PY - 2016/6/8

Y1 - 2016/6/8

N2 - The irregularity of a graph G is defined as the sum of weights d(u) - d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively.

AB - The irregularity of a graph G is defined as the sum of weights d(u) - d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively.

KW - Branching number

KW - Degree sequence

KW - Irregularity

KW - Trees

UR - http://www.scopus.com/inward/record.url?scp=84979547147&partnerID=8YFLogxK

U2 - 10.46298/dmtcs.2146

DO - 10.46298/dmtcs.2146

M3 - Journal article

AN - SCOPUS:84979547147

SN - 1462-7264

VL - 17

SP - 203

EP - 216

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

IS - 3

ER -

The irregularity of two types of trees

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this