G. Bloom and S. Ruiz, “Decomposition into Linear Forest and Difference Labelings of Graphs,” Discrete Applied Mathematics, Vol. 49, 1994, pp. 61-75. doi:10.1016/0166-218X(94)90201-1

has been cited by the following article:

• TITLE: Some Results on Vertex Equitable Labeling

  AUTHORS: P. Jeyanthi, A. Maheswari

  KEYWORDS: Vertex Equitable Labeling; Vertex Equitable Graph

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.2, April 27, 2012

  ABSTRACT: Let G be a graph with p vertices and q edges and let A= vertex labeling is said to be a vertex equitable labeling of G if it induces an edge labeling given by such that and , where is the number of vertices v with for A graph G is said to be a vertex equitable graph if it admits vertex equitable labeling. In this paper, we establish the vertex equitable labeling of a Tp-tree, where T is a Tp-tree with even number of vertices, bistar the caterpillar and crown