The irregularity of two types of trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2016

The irregularity of two types of trees

Résumé

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.
Fichier principal
Vignette du fichier
2807-9939-1-PB.pdf (368.23 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-01352840 , version 1 (16-08-2016)

Identifiants

Citer

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

Collections

TDS-MACS
58 Consultations
796 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More