Name
Abstract | ||
|---|---|---|
A vertex irregular total k-labelling @l:V(G)@?E(G)@?{1,2,...,k} of a graph G is a labelling of vertices and edges of G done in such a way that for any different vertices x and y, their weights wt(x) and wt(y) are distinct. The weight wt(x) of a vertex x is the sum of the label of x and the labels of all edges incident with x. The minimum k for which a graph G has a vertex irregular total k-labelling is called the total vertex irregularity strength of G, denoted by tvs(G). In this paper, we determine the total vertex irregularity strength of trees. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.06.041 | Discrete Mathematics |
Keywords | Field | DocType |
trees,total vertex irregularity strength | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Vertex (graph theory),Neighbourhood (graph theory),Degree (graph theory),Mathematics,Graph labelling | Journal |
Volume | Issue | ISSN |
310 | 21 | Discrete Mathematics |
Citations | PageRank | References |
12 | 0.78 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nurdin | 1 | 12 | 0.78 |
| E.T. Baskoro | 2 | 21 | 2.78 |
| A.N.M. Salman | 3 | 29 | 4.31 |
| N.N. Gaos | 4 | 12 | 0.78 |