EUVIMEDEUVIMED entdecken
Crossref

Laplacian energy of trees with at most 10 vertices

Masood Ur Rehman, Muhammad Ajmal, Tayyab Kamran

Indonesian Journal of Combinatorics · 2018

DOI: 10.19184/ijc.2018.2.1.3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von Masood Ur Rehman und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let Tn be the set of all trees with n ≤ 10 vertices. We show that the Laplacian energy of any tree Tn is strictly between the Laplacian energy of the path Pn and the star Sn, partially proving the conjecture that this hold for any tree.

Zitieren

APA

Rehman, M. U., Ajmal, M., & Kamran, T. (2018). Laplacian energy of trees with at most 10 vertices. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.1.3

Vancouver

Rehman MU, Ajmal M, Kamran T. Laplacian energy of trees with at most 10 vertices. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.1.3

BibTeX
@article{Rehman2018,
  author = {Rehman, Masood Ur and Ajmal, Muhammad and Kamran, Tayyab},
  title = {Laplacian energy of trees with at most 10 vertices},
  journal = {Indonesian Journal of Combinatorics},
  year = {2018},
  doi = {10.19184/ijc.2018.2.1.3}
}
Kostenlos starten →