Jianxi, Li and Liu, Yang and Shiu, Wai - The irregularity of two types of trees

dmtcs:2146 - Discrete Mathematics & Theoretical Computer Science, June 8, 2016, Vol. 17 no. 3
The irregularity of two types of trees

Authors: Jianxi, Li and Liu, Yang and Shiu, Wai

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.


Source : oai:HAL:hal-01352840v1
Volume: Vol. 17 no. 3
Section: Graph Theory
Published on: June 8, 2016
Submitted on: June 23, 2015
Keywords: branching number,Irregularity, trees, degree sequence,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 40 times.
This article's PDF has been downloaded 51 times.