Indonesian Journal of CombinatoricsVol 2, No 1 (2018)
Laplacian energy of trees with at most 10 vertices
Masood Ur Rehman(University of Science and Technology of China (USTC), School of Mathematical Sciences.) Muhammad Ajmal(University of Science and Technology of China (USTC), School of Mathematical Sciences.) Tayyab Kamran(Department of Mathematics, Quaid-I-Azam University, Islamabad-Pakistan)
Article Info
Publish Date 12 Jun 2018
Abstract
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, the authors partially proving that the conjecture hold for any tree Tn, where n ≤ 10.
Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics.
IJC is published by the Indonesian ...