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...
Triangulated categories coming from cyclic posets were originally introduced by the authors in a previous paper as a generalization of the constructions of various triangulated categories with cluster structures.We gi...
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...
Let C be a set of colors, and let ?be an integer cost assigned to a color c in C. An edge-coloring of a graph ?is assigning a color in C to each edge ?so that any two edges having end-vertex in common have different c...
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...