In this article,we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique.As a consequence,we obtain an upper bound for the regularity of binomia...
Supported by the National Natural Science Foundations of China(No.11401102)
In this paper we give six explicit formulae to compute the Kirchhoff index,the multiplicative degree-Kirchhoff index and the additive degree-Kirchhoff index of the k-cactus chain and the cactus graph which can be obta...
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...