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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.203-216
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01352840
Contributeur : Coordination Episciences Iam <>
Soumis le : mardi 16 août 2016 - 17:10:56
Dernière modification le : jeudi 7 septembre 2017 - 01:03:45
Document(s) archivé(s) le : jeudi 17 novembre 2016 - 10:30:10

Fichier

2807-9939-1-PB.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-01352840, version 1

Collections

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. 〈hal-01352840〉

Partager

Métriques

Consultations de la notice

76

Téléchargements de fichiers

229