Name
Abstract | ||
|---|---|---|
It is proved that if t is a fixed positive integer and n is sufficiently large, then each graph of order n with minimum degree n − t has an assignment of weights 1, 2 or 3 to the edges in such a way that weighted degrees of the vertices become distinct. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0012-365X(91)90161-T | Discrete Mathematics |
Keywords | Field | DocType |
dense graph,irregularity strength | Integer,Discrete mathematics,Complete graph,Combinatorics,Vertex (geometry),Upper and lower bounds,Vertex (graph theory),Bipartite graph,Regular graph,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
91 | 1 | Discrete Mathematics |
Citations | PageRank | References |
4 | 1.67 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| M. S. Jacobson | 2 | 198 | 40.79 |
| L. Kinch | 3 | 4 | 1.67 |
| J. Lehel | 4 | 391 | 75.03 |