HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

# 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 :
Document type :
Journal articles

Cited literature [13 references]

https://hal.inria.fr/hal-01352840
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, August 16, 2016 - 5:10:56 PM
Last modification on : Thursday, September 7, 2017 - 1:03:45 AM
Long-term archiving on: : Thursday, November 17, 2016 - 10:30:10 AM

### File

2807-9939-1-PB.pdf
Explicit agreement for this submission

### Citation

Li Jianxi, Yang Liu, Wai Shiu. The irregularity of two types of trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.203-216. ⟨10.46298/dmtcs.2146⟩. ⟨hal-01352840⟩

Record views