DOAJ Open Access 2016

The irregularity of two types of trees

Li Jianxi Yang Liu Wai Shiu

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (3)

Li Jianxi

Yang Liu

Wai Shiu

Format Sitasi

APA MLA BibTeX

Jianxi, L., Liu, Y., Shiu, W. (2016). The irregularity of two types of trees. https://doi.org/10.46298/dmtcs.2146

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2146

Informasi Jurnal

Tahun Terbit: 2016
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2146
Akses: Open Access ✓