Being bipartite graphs, all trees are good candidates for calculating the incidence energy of a graph which is obtained by means of the incidence matrix instead of the classical way of employing the adjacency matrix. There are a lot of results on incidence energy and there is a good literature survey of them in this paper. The authors characterize the trees with the fourth smallest, the fifth smallest and the fourth maximal incidence energy amongst all trees having \(n\) vertices by the quasi-order method and the Coulson integral formula. Several inequalities for these energies are obtained according to the number of vertices of the tree. This is a nice and informative paper on the theory although the general idea and the results of the paper are simple and classical which reduces the importance of it.
This page was built for publication: On incidence energy of tree.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828982)
